Zobrazeno 1 - 10
of 302
pro vyhledávání: '"Sun Xiaorui"'
The Segment Anything Model (SAM) is a foundational model for image segmentation tasks, known for its strong generalization across diverse applications. However, its impressive performance comes with significant computational and resource demands, mak
Externí odkaz:
http://arxiv.org/abs/2410.04960
Autor:
Qiao, Youming, Sun, Xiaorui
Left-right and conjugation actions on matrix tuples have received considerable attention in theoretical computer science due to their connections with polynomial identity testing, group isomorphism, and tensor isomorphism. In this paper, we present p
Externí odkaz:
http://arxiv.org/abs/2409.12457
Publikováno v:
E3S Web of Conferences, Vol 198, p 03004 (2020)
A methodology to properly screen all UBD techniques to reduce failure/misapplication and align objectives with expectations had been absent. The paper addresses the latest enhancements to better understand and screen options for UBD operations accord
Externí odkaz:
https://doaj.org/article/cf7051ae69f94c869e85c36c54cc7067
Autor:
Sun, Xiaorui
The group isomorphism problem determines whether two groups, given by their Cayley tables, are isomorphic. For groups with order $n$, an algorithm with $n^{(\log n + O(1))}$ running time, attributed to Tarjan, was proposed in the 1970s [Mil78]. Despi
Externí odkaz:
http://arxiv.org/abs/2303.15412
A geometric graph associated with a set of points $P= \{x_1, x_2, \cdots, x_n \} \subset \mathbb{R}^d$ and a fixed kernel function $\mathsf{K}:\mathbb{R}^d\times \mathbb{R}^d\to\mathbb{R}_{\geq 0}$ is a complete graph on $P$ such that the weight of e
Externí odkaz:
http://arxiv.org/abs/2211.14825
Autor:
Sun, Xiaorui1 (AUTHOR) xiaoruisun123456@outlook.com, Wu, Henan1 (AUTHOR), Yu, Guang1 (AUTHOR), Zheng, Nan1 (AUTHOR) 13756065218@139.com
Publikováno v:
Mathematics (2227-7390). Jun2024, Vol. 12 Issue 11, p1714. 16p.
Longest common subsequence ($\mathsf{LCS}$) is a classic and central problem in combinatorial optimization. While $\mathsf{LCS}$ admits a quadratic time solution, recent evidence suggests that solving the problem may be impossible in truly subquadrat
Externí odkaz:
http://arxiv.org/abs/2111.10538
We provide universally-optimal distributed graph algorithms for $(1+\varepsilon)$-approximate shortest path problems including shortest-path-tree and transshipment. The universal optimality of our algorithms guarantees that, on any $n$-node network $
Externí odkaz:
http://arxiv.org/abs/2110.15944
Publikováno v:
In Virtual Reality & Intelligent Hardware August 2024 6(4):267-279
We study distributed algorithms built around minor-based vertex sparsifiers, and give the first algorithm in the CONGEST model for solving linear systems in graph Laplacian matrices to high accuracy. Our Laplacian solver has a round complexity of $O(
Externí odkaz:
http://arxiv.org/abs/2012.15675