Zobrazeno 1 - 10
of 1 051
pro vyhledávání: '"wu, Zhuo"'
Evaluating the quality of recommender systems is critical for algorithm design and optimization. Most evaluation methods are computed based on offline metrics for quick algorithm evolution, since online experiments are usually risky and time-consumin
Externí odkaz:
http://arxiv.org/abs/2412.11068
A well-known theorem of Nikiforov asserts that any graph with a positive $K_{r}$-density contains a logarithmic blowup of $K_r$. In this paper, we explore variants of Nikiforov's result in the following form. Given $r,t\in\mathbb{N}$, when a positive
Externí odkaz:
http://arxiv.org/abs/2410.07098
Let $P$ be a $2n$-point set in the plane that is in general position. We prove that every red-blue bipartition of $P$ into $R$ and $B$ with $|R| = |B| = n$ generates $\Omega(n^{3/2})$ red-red-blue empty triangles.
Comment: 9 pages, 3 figures
Comment: 9 pages, 3 figures
Externí odkaz:
http://arxiv.org/abs/2409.17078
Autor:
Lamaison, Ander, Wu, Zhuo
We asymptotically resolve the the uniform Tur\'an density problem for the large stars. In particular, we show that the uniform Tur\'an density of the $k$-star $S_k$ is $\frac{k^2-5k+7}{(k-1)^2}$ for $k\ge 48$, matching a lower construction by Reiher,
Externí odkaz:
http://arxiv.org/abs/2409.03699
An edge colouring of $K_n$ with $k$ colours is a Gallai $k$-colouring if it does not contain any rainbow triangle. Gy\'arf\'as, P\'alv\"olgyi, Patk\'os and Wales proved that there exists a number $g(k)$ such that $n\geq g(k)$ if and only if for any c
Externí odkaz:
http://arxiv.org/abs/2309.05606
Autor:
Masouris, Athanasios, Sharma, Mansi, Boguszewski, Adrian, Kozlov, Alexander, Wu, Zhuo, Lo, Raymond
Quantization is a widely adopted technique for deep neural networks to reduce the memory and computational resources required. However, when quantized, most models would need a suitable calibration process to keep their performance intact, which requ
Externí odkaz:
http://arxiv.org/abs/2305.06052
Autor:
Wu, Zhuo
The \emph{minimum positive co-degree} $\delta^{+}_{r-1}(H)$ of a non-empty $r$-graph $H$ is the maximum $k$ such that if $S$ is an $(r-1)$-set contained in a hyperedge of $H$, then $S$ is contained in at least $k$ hyperedges of $H$. For any $r$-graph
Externí odkaz:
http://arxiv.org/abs/2212.12815
Autor:
Dong, Xing-Duo, Zhang, Meng, Teng, Qiu-Xu, Lei, Zi-Ning, Cai, Chao-Yun, Wang, Jing-Quan, Wu, Zhuo-Xun, Yang, Yuqi, Chen, Xiang, Guo, Huiqin, Chen, Zhe-Sheng
Publikováno v:
In Cancer Letters 28 December 2024 607
Publikováno v:
In Ecological Informatics December 2024 84
Autor:
Han, Mengjia, Xiao, Xiaoyun, Wu, Zhuo, Wu, Wei, Cui, Junwei, Lai, Zijia, Zhuang, Zilin, Ma, Bingbing, Lei, Rong, tan, Cui, Nie, Yan
Publikováno v:
In Clinical Surgical Oncology December 2024 3(4)