2 citations · 2 across the 1 of their papers we have counts for
3 papers
cs.DS2021★ 2 cited
Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing
Goran Zuzic, Gramoz Goranci, Mingquan Ye +2
We provide universally-optimal distributed graph algorithms for -approximate shortest path problems including shortest-path-tree and transshipment. The universal o…
cs.LG2018
On Geometric Alignment in Low Doubling Dimension
Hu Ding, Mingquan Ye
In real-world, many problems can be formulated as the alignment between two geometric patterns. Previously, a great amount of research focus on the alignment of 2D or 3D patterns,…
cs.CG2018
A Novel Geometric Approach for Outlier Recognition in High Dimension
Hu Ding, Mingquan Ye
Outlier recognition is a fundamental problem in data analysis and has attracted a great deal of attention in the past decades. However, most existing methods still suffer from seve…