Zobrazeno 1 - 10
of 1 606
pro vyhledávání: '"ZHANG, YANBO"'
A graph is diameter-$k$-critical if its diameter equals $k$ and the deletion of any edge increases its diameter. The Murty-Simon Conjecture states that for any diameter-2-critical graph $G$ of order $n$, $e(G) \leq \lfloor \frac{n^2}{4}\rfloor$, with
Externí odkaz:
http://arxiv.org/abs/2409.17491
Autor:
Zhang, Chongsheng, Almpanidis, George, Fan, Gaojuan, Deng, Binquan, Zhang, Yanbo, Liu, Ji, Kamel, Aouaidjia, Soda, Paolo, Gama, João
Long-tailed data is a special type of multi-class imbalanced data with a very large amount of minority/tail classes that have a very significant combined influence. Long-tailed learning aims to build high-performance models on datasets with long-tail
Externí odkaz:
http://arxiv.org/abs/2408.00483
Autor:
Zhang, Yanbo
This paper proposes a novel signal processing technique that doubles the range resolution of FMCW~(Frequency Modulated Continuous Wave) sensing without increasing the required bandwidth. The proposed design overcomes the resolution limit imposed by b
Externí odkaz:
http://arxiv.org/abs/2404.04606
For two graphs $G_1$ and $G_2$, the size Ramsey number $\hat{r}(G_1,G_2)$ is the smallest positive integer $m$ for which there exists a graph $G$ of size $m$ such that for any red-blue edge-coloring of the graph $G$, $G$ contains either a red subgrap
Externí odkaz:
http://arxiv.org/abs/2404.04432
Recently, Caro, Patk\'os, and Tuza (2022) introduced the concept of connected Tur\'an number. We study a similar parameter in Ramsey theory. Given two graphs $G_1$ and $G_2$, the size Ramsey number $\hat{r}(G_1,G_2)$ refers to the smallest number of
Externí odkaz:
http://arxiv.org/abs/2404.03175
Autor:
Zhang, Yanbo, Chen, Yaojun
Given two graphs $G_1$ and $G_2$, the Ramsey number $r(G_1,G_2)$ refers to the smallest positive integer $N$ such that any graph $G$ with $N$ vertices contains $G_1$ as a subgraph, or the complement of $G$ contains $G_2$ as a subgraph. A connected gr
Externí odkaz:
http://arxiv.org/abs/2310.13204
Autor:
Zhang, Yanbo, Zhang, Yixin
For two graphs $G_1$ and $G_2$, the online Ramsey number $\tilde{r}(G_1,G_2)$ is the smallest number of edges that Builder draws on an infinite empty graph to guarantee that there is either a red copy of $G_1$ or a blue copy of $G_2$, under the condi
Externí odkaz:
http://arxiv.org/abs/2302.13640
Given two graphs $G$ and $H$, the online Ramsey number $\tilde{r}(G,H)$ is defined to be the minimum number of rounds that Builder can always guarantee a win in the following $(G, H)$-online Ramsey game between Builder and Painter. Starting from an i
Externí odkaz:
http://arxiv.org/abs/2302.08787
Autor:
Zhang, Yanbo, Walker, Sara Imari
The high-dimesionality, non-linearity and emergent properties of complex systems pose a challenge to identifying general laws in the same manner that has been so successful in simpler physical systems. In Anderson's seminal work on why "more is diffe
Externí odkaz:
http://arxiv.org/abs/2210.07374
Given two graphs $G_1, G_2$, the connected size Ramsey number ${\hat{r}}_c(G_1,G_2)$ is defined to be the minimum number of edges of a connected graph $G$, such that for any red-blue edge colouring of $G$, there is either a red copy of $G_1$ or a blu
Externí odkaz:
http://arxiv.org/abs/2205.03965