Near linear lower bound for dimension reduction in ℓ1

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2011, Pages 315-323

  Andoni, Alexandr ^a   Charikar, Moses S ^b   Neiman, Ofer ^b   Nguyen, Huy L ^b  

^a MICROSOFT RESEARCH   (United States)

^b Princeton University   (United States)

Author keywords

dimension reduction; metric embedding

Indexed keywords

DIMENSION REDUCTION; LOWER BOUNDS; METRIC EMBEDDINGS; SHARP CONTRAST; UPPER AND LOWER BOUNDS;

COMPUTER SCIENCE;

EID: 84863306372     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2011.87     Document Type: Conference Paper

References (16)

1. N. Alon, "Problems and results in extremal combinatorics,"I, Discrete Math., vol. 273, pp. 31-53, 2003.
2. K. Ball, "Markov chains, Riesz transforms and Lipschitz maps," Geom. Funct. Anal., vol. 2, no. 2, pp. 137-172, 1992.
3. J. D. Batson, D. A. Spielman, and N. Srivastava, "Twice-ramanujan sparsifiers," in STOC '09: Proceedings of the 41st annual ACM symposium on Theory of computing. New York, NY, USA: ACM, 2009, pp. 255-262.
4. 1," J. ACM, vol. 52, pp. 766-788, September 2005. [Online]. Available: http://doi.acm.org/10.1145/1089023.1089026
5. 1norm," in FOCS '02: Proceedings of the 43rd Symposium on Foundations of Computer Science. Washington, DC, USA: IEEE Computer Society, 2002, pp. 551-560.
6. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni, "Locality-sensitive hashing scheme based on p-stable distributions,"in SCG '04: Proceedings of the twentieth annual symposium on Computational geometry. New York, NY, USA: ACM, 2004, pp. 253-262.
7. P. Indyk, "Algorithmic applications of low-distortion geometric embeddings," in Proceedings of the 42nd IEEE symposium on Foundations of Computer Science, ser. FOCS '01. Washington, DC, USA: IEEE Computer Society, 2001, pp. 10-. [Online]. Available: http://portal.acm.org/citation.cfm?id= 874063.875596
8. -, "Stable distributions, pseudorandom generators, embeddings, and data stream computation," J. ACM, vol. 53, no. 3, pp. 307-323, 2006.
9. P. Indyk and R. Motwani, "Approximate nearest neighbors: towards removing the curse of dimensionality," in Proceedings of the thirtieth annual ACM symposium on Theory of computing, ser. STOC '98. New York, NY, USA: ACM, 1998, pp. 604-613. [Online]. Available: http://doi.acm.org/10.1145/276698. 276876
10. W. B. Johnson and J. Lindenstrauss, "Extensions of Lipschitz mappings into a Hilbert space," in Conference in modern analysis and probability (New Haven, Conn., 1982). Providence, RI: Amer. Math. Soc., 1984, pp. 189-206.
11. J. M. Kleinberg, "Two algorithms for nearest-neighbor search in high dimensions," in Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, ser. STOC '97. New York, NY, USA: ACM, 1997, pp. 599-608. [Online]. Available: http://doi.acm.org/10.1145/258533. 258653
12. E. Kushilevitz, R. Ostrovsky, and Y. Rabani, "Efficient search for approximate nearest neighbor in high dimensional spaces," SIAM Journal on Computing, vol. 30, no. 2, pp. 457-474, 2000. [Online]. Available: http://link.aip.org/link/?SMJ/30/457/1
13. 1," Geometric and Functional Analysis (GAFA) 14(4), pp. 745-747, 2004.
14. 1metrics and volumes, and related sparsification techniques,"in arxiv:. arxiv.org/abs/1002.3541, 2010.
15. n,"Composio Math., vol. 61(2), pp. 159-169, 1987.
16. n,"Proceedings of the American Mathematical Society, vol. 108, no. 2, pp. pp. 363-369, 1990. [Online]. Available: http://www.jstor.org/stable/2048283