1-pass relative-error Lp-sampling with applications
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Near-optimal private approximation protocols via a black box transformation
Proceedings of the forty-third annual ACM symposium on Theory of computing
Subspace embeddings for the L1-norm with applications
Proceedings of the forty-third annual ACM symposium on Theory of computing
Comparing distributions and shapes using the kernel distance
Proceedings of the twenty-seventh annual symposium on Computational geometry
Streaming algorithms with one-sided estimation
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Algorithms for the transportation problem in geometric settings
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The streaming complexity of cycle counting, sorting by reversals, and other problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Space-Efficient approximation scheme for circular earth mover distance
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Supervised earth mover's distance learning and its computer vision applications
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part I
| Hi-index | 0.00 |
We provide the first sub-linear sketching algorithm for estimating the planar Earth-Mover Distance with a constant approximation. For sets living in the two-dimensional grid $[\Delta]^2$, we achieve space$\Delta^{\eps}$ for approximation $O(1/\eps)$, for any desired $0