1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2011
An Efficient Partitioning Oracle for Bounded-Treewidth Graphs
Alan Edelman, Avinatan Hassidim, Huy N. Nguyen +1
Partitioning oracles were introduced by Hassidim et al. (FOCS 2009) as a generic tool for constant-time algorithms. For any epsilon > 0, a partitioning oracle provides query access…
cs.DS2009★ 1 cited
Sublinear Time Algorithms for Earth Mover's Distance
Khanh Do Ba, Huy L Nguyen, Huy N Nguyen +1
We study the problem of estimating the Earth Mover's Distance (EMD) between probability distributions when given access only to samples. We give closeness testers and additive-erro…