Better embeddings for planar Earth-Mover Distance over sparse sets
暂无分享,去创建一个
[1] Leonidas J. Guibas,et al. The Earth Mover's Distance as a Metric for Image Retrieval , 2000, International Journal of Computer Vision.
[2] A. Naor,et al. Nonembeddability theorems via Fourier analysis Extended abstract , 2005 .
[3] Alexandr Andoni,et al. Earth mover distance over high-dimensional spaces , 2008, SODA '08.
[4] Moses Charikar,et al. Similarity estimation techniques from rounding algorithms , 2002, STOC '02.
[5] Günter Rote,et al. Matching Point Sets with Respect to the Earth Mover's Distance , 2005, ESA.
[6] R. Sharathkumar,et al. A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates , 2013, SoCG '13.
[7] Piotr Indyk,et al. Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.
[8] Piotr Indyk,et al. Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality , 2012, Theory Comput..
[9] Piotr Indyk,et al. Combining geometry and combinatorics: A unified approach to sparse signal recovery , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.
[10] Gideon Schechtman,et al. Planar Earthmover is not in L_1 , 2005, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[11] Patrice Assouad. Plongements lipschitziens dans ${\mathbb {R}}^n$ , 1983 .
[12] P. Assouad. Plongements lipschitziens dans Rn , 2003 .