Rademacher-sketch: A dimensionality-reducing embedding for sum-product norms, with an application to earth-mover distance

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7391 LNCS, Issue PART 1, 2012, Pages 834-845

  Verbin, Elad ^a   Zhang, Qin ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

NORMED SPACES; SUM PRODUCT;

APPROXIMATION ALGORITHMS;

AUTOMATA THEORY;

EID: 84883785464     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31594-7_70     Document Type: Conference Paper

References (33)

1. Agarwal, P.K., Efrat, A., Sharir, M.: Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. In: SoCG, pp. 39-50 (1995)
2. Agarwal, P.K., Varadarajan, K.R.: A near-linear constant-factor approximation for euclidean bipartite matching? In: Symposium on Computational Geometry, pp. 247-252 (2004)
3. Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58, 137-147 (1999)
4. Andoni, A., Ba, K.D., Indyk, P.,Woodruff, D.: Efficient sketches for earth-mover distance, with applications. In: FOCS (2009)
5. 1. In: IEEE Symposium on Foundations of Computer Science (2011)
6. 1 non-embeddability barrier: algorithms for product metrics. In: SODA, pp. 865-874 (2009)
7. Andoni, A., Krauthgamer, R., Onak, K.: Streaming algorithms via precision sampling. In: FOCS, pp. 363-372 (2011)
8. Andoni, A., Nguyen, H.L.: Near-optimal sublinear time algorithms for Ulam distance. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, pp. 76-86 (2010)
9. Andoni, A., Onak, K.: Approximating edit distance in near-linear time. In: STOC, pp. 199-204 (2009)
10. 1. J. ACM 52, 766-788 (2005)
11. Charikar, M.S.: Similarity estimation techniques from rounding algorithms. In: STOC, pp. 380-388 (2002)
12. Chefd'hotel, C., Bousquet, G.: Intensity-based image registration using earth mover's distance. In: SPIE (2007)
13. Deng, Y., Du,W.: The Kantorovich metric in computer science: A brief survey. Electr.Notes Theor. Comput. Sci. 253(3), 73-82 (2009)
14. Grauman, K., Darrell, T.: Fast contour matching using approximate earth movers distance. In: CVPR, pp. 220-227 (2004)
15. Holmes, A.S., Rose, C.J., Taylor, C.J.: Transforming pixel signatures into an improved metric space. Image Vision Comput 20(9-10), 701-707 (2002)
16. Indyk, P.: Algorithmic aspects of geometric embeddings. In: IEEE Symposium on Foundations of Computer Science (2001)
17. Indyk, P.: Stable distributions, pseudorandom generators, embeddings, and data stream computation. J. ACM 53, 307-323 (2006)
18. Indyk, P.: A near linear time constant factor approximation for euclidean bichromatic matching (cost). In: SODA, pp. 39-42 (2007)
19. Indyk, P., Matousek, J.: Low-distortion embeddings of finite metric spaces. In: Handbook of Discrete and Computational Geometry, pp. 177-196. CRC Press (2004)
20. Indyk, P., Thaper, N.: Fast color image retrieval via embeddings. In:Workshop on Statistical and Computational Theories of Vision, at ICCV (2003)
21. Johnson, W., Lindenstrauss, J.: Extensions of Lipschitz mappings into a Hilbert space. In: Conference in modern analysis and probability (New Haven, Conn., 1982). Contemporary Mathematics, vol. 26, pp. 189-206. American Mathematical Society (1984)
22. Kantorovich, L.V.: On the translocation of masses. Dokl. Akad. Nauk SSSR 37(7-8), 227-229 (1942)
23. Lawler, E.: Combinatorial optimization - networks and matroids. Holt, Rinehart and Winston, New York (1976)
24. Levina, E., Bickel, P.J.: The earth mover's distance is the mallows distance: Some insights from statistics. In: ICCV, pp. 251-256 (2001)
25. Linial, N.: Finite metric spaces - combinatorics, geometry and algorithms. In: Proceedings of the International Congress of Mathematicians III, pp. 573-586 (2002)
26. Maurey, B.: Type, cotype and k-convexity. In: Handbook of the Geometry of Banach Spaces, vol. 2, pp. 1299-1332. North-Holland (2003)
27. McGregor, A.: Open problems in data streams, property testing, and related topics (2011), http://www.cs.umass.edu/~mcgregor/papers/11-openproblems. pdf
28. 1. SIAMJ. Comput. 37(3), 804-826 (2007)
29. Nisan, N.: Pseudorandom generators for space-bounded computations. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, STOC 1990, pp. 204-212 (1990)
30. Puzicha, J., Buhmann, J.M., Rubner, Y., Tomasi, C.: Empirical evaluation of dissimilarity measures for color and texture. In: ICCV, pp. 1165-1173 (1999)
31. Rubner, Y., Tomasi, C., Guibas, L.J.: The earth movers distance as a metric for image retrieval. International Journal of Computer Vision 40 (2000)
32. Vaidya, P.M.: Geometry helps in matching. SIAM J. Comput. 18, 1201-1225 (1989)
33. Varadarajan, K.R., Agarwal, P.K.: Approximation algorithms for bipartite and non-bipartite matching in the plane. In: SODA, pp. 805-814 (1999)