Zobrazeno 1 - 10
of 698
pro vyhledávání: '"Wang, ShiXin"'
For $\textbf{r}=(r_1,\ldots,r_k)$, an $\textbf{r}$-factorization of the complete $\lambda$-fold $h$-uniform $n$-vertex hypergraph $\lambda K_n^h$ is a partition of the edges of $\lambda K_n^h$ into $F_1,\ldots, F_k$ such that $F_j$ is $r_j$-regular a
Externí odkaz:
http://arxiv.org/abs/2409.10950
Autor:
Wang, Shixin
It is generally challenging to characterize the optimal selling mechanism even when the seller knows the buyer's valuation distributions in multi-item screening. An insightful and significant result in robust mechanism design literature is that if th
Externí odkaz:
http://arxiv.org/abs/2408.13580
In this paper, we introduce the concept of $k$-integral graphs. A graph $\Gamma$ is called $k$-integral if the extension degree of the splitting field of the characteristic polynomial of $\Gamma$ over rational field $\mathbb Q$ is equal to $k$. We pr
Externí odkaz:
http://arxiv.org/abs/2401.15306
Autor:
Wang, Linlin, Wang, Shixin, Wang, Peng, Wang, Wei, Wang, Dezhao, Wang, Yongcai, Wang, Shanwen
In the realm of intelligent transportation systems, accurate and reliable traffic monitoring is crucial. Traditional devices, such as cameras and lidars, face limitations in adverse weather conditions and complex traffic scenarios, prompting the need
Externí odkaz:
http://arxiv.org/abs/2402.09422
Autor:
Wang, Shixin
We study a robust selling problem where a seller attempts to sell one item to a buyer but is uncertain about the buyer's valuation distribution. Existing literature shows that robust screening provides a stronger theoretical guarantee than robust det
Externí odkaz:
http://arxiv.org/abs/2310.17392
For a digraph $\Gamma$, if $F$ is the smallest field that contains all roots of the characteristic polynomial of the adjacency matrix of $\Gamma$, then $F$ is called the splitting field of $\Gamma$. The extension degree of $F$ over the field of ratio
Externí odkaz:
http://arxiv.org/abs/2308.03066
Autor:
Baek, Jackie, Wang, Shixin
We study online weighted bipartite matching of reusable resources where an adversarial sequence of requests for resources arrive over time. A resource that is matched is 'used' for a random duration, drawn independently from a resource-dependent dist
Externí odkaz:
http://arxiv.org/abs/2304.03377
Autor:
Qin, Gang1,2,3 (AUTHOR) qingang20@mails.ucas.ac.cn, Wang, Shixin1,2,3 (AUTHOR), Wang, Futao1,2,3 (AUTHOR) wangft@aircas.ac.cn, Li, Suju2,4 (AUTHOR), Wang, Zhenqing1,2,3 (AUTHOR), Zhu, Jinfeng1,2 (AUTHOR), Liu, Ming2,4 (AUTHOR), Gu, Changjun2,4 (AUTHOR), Zhao, Qing1,2 (AUTHOR)
Publikováno v:
Remote Sensing. Nov2024, Vol. 16 Issue 22, p4328. 17p.
Autor:
Abdullahi, Muhammad Rabiu a, b, Lu, Qing-Chang a, Hussain, Adil a, ⁎, Tripura, Sajib a, c, Xu, Peng-Cheng a, Wang, ShiXin a
Publikováno v:
In Energy Reports December 2024 12:5367-5382
Publikováno v:
In International Journal of Biological Macromolecules December 2024 283 Part 3