Sublinear time algorithms for earth mover's distance

Sublinear time algorithms for earth mover's distance

We study the problem of estimating the Earth Mover's Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness testers and additive-error estimators over domains in [0, 1][superscript d], with sample complexities independent of do...

Full description

Bibliographic Details
Main Authors: Do Ba, Khanh (Contributor), Nguyen, Huy L. (Contributor), Nguyen, Huy N. (Contributor), Rubinfeld, Ronitt (Contributor)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Springer New York, 2012-07-11T14:18:02Z.
Subjects:
Article
Online Access:Get fulltext

Similar Items

Similar Items