SIAM Journal on Computing
Pseudorandom generators for space-bounded computations
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
Proceedings of the eleventh annual symposium on Computational geometry
The space complexity of approximating the frequency moments
Journal of Computer and System Sciences
Approximation algorithms for bipartite and non-bipartite matching in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The Earth Mover's Distance as a Metric for Image Retrieval
International Journal of Computer Vision
Similarity estimation techniques from rounding algorithms
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Finite metric spaces: combinatorics, geometry and algorithms
Proceedings of the eighteenth annual symposium on Computational geometry
Empirical Evaluation of Dissimilarity Measures for Color and Texture
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Algorithmic Applications of Low-Distortion Geometric Embeddings
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A near-linear constant-factor approximation for euclidean bipartite matching?
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
On the impossibility of dimension reduction in l1
Journal of the ACM (JACM)
Stable distributions, pseudorandom generators, embeddings, and data stream computation
Journal of the ACM (JACM)
A near linear time constant factor approximation for Euclidean bichromatic matching (cost)
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Planar Earthmover Is Not in $L_1$
SIAM Journal on Computing
Overcoming the l1 non-embeddability barrier: algorithms for product metrics
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximating edit distance in near-linear time
Proceedings of the forty-first annual ACM symposium on Theory of computing
The Kantorovich Metric in Computer Science: A Brief Survey
Electronic Notes in Theoretical Computer Science (ENTCS)
Efficient Sketches for Earth-Mover Distance, with Applications
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Near-optimal sublinear time algorithms for Ulam distance
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Streaming Algorithms via Precision Sampling
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Near Linear Lower Bound for Dimension Reduction in L1
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Moving heaven and earth: distances between distributions
ACM SIGACT News
Hi-index | 0.00 |
Consider a sum-product normed space, i.e. a space of the form $Y=\ell_1^n \otimes X$, where X is another normed space. Each element in Y consists of a length-n vector of elements in X, and the norm of an element in Y is the sum of the norms of its coordinates. In this paper we show a constant-distortion embedding from the normed space $\ell_1^n \otimes X$ into a lower-dimensional normed space $\ell_1^{n'} \otimes X$, where n′≪n is some value that depends on the properties of the normed space X (namely, on its Rademacher dimension). In particular, composing this embedding with another well-known embedding of Indyk [18], we get an O(1/ε)-distortion embedding from the earth-mover metric EMDΔ on the grid [Δ]2 to $\ell_1^{\Delta^{O(\epsilon)}} \otimes {\sf{EEMD}}_{\Delta^{\epsilon }}$ (where EEMD is a norm that generalizes earth-mover distance). This embedding is stronger (and simpler) than the sketching algorithm of Andoni et al [4], which maps EMDΔ with O(1/ε) approximation into sketches of size ΔO(ε).