ECCC
Electronic Colloquium on Computational Complexity
Login | Register | Classic Style



REPORTS > KEYWORD > EMBEDDING:
Reports tagged with Embedding:
TR07-012 | 22nd January 2007
Shachar Lovett, Sasha Sodin

Almost Euclidean sections of the N-dimensional cross-polytope using O(N) random bits

Revisions: 1
It is well known that $\R^N$ has subspaces of dimension proportional to $N$ on which the $\ell_1$ norm is equivalent to the $\ell_2$ norm; however, no explicit constructions are known. Extending earlier work by Artstein--Avidan and Milman, we prove that such a subspace can be generated using $O(N)$ random bits. more >>>

TR07-048 | 3rd April 2007
Alexandr Andoni, Piotr Indyk, Robert Krauthgamer

Earth Mover Distance over High-Dimensional Spaces

The Earth Mover Distance (EMD) between two equal-size sets of points in R^d is defined to be the minimum cost of a bipartite matching between the two pointsets. It is a natural metric for comparing sets of features, and as such, it has received significant interest in computer vision. Motivated ... more >>>



ISSN 1433-8092 | Imprint