On the optimality of the dimensionality reduction method

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

Volumn , Issue , 2006, Pages 449-458

  Andoni, Alexandr ^a   Indyk, Piotr ^a   Pǎtraşcu, Mihai ^a  

^a Dept of Aeronautics and Astronautics

Author keywords

[No Author keywords available]

Indexed keywords

DIMENSIONALITY REDUCTION METHOD; HAMMING SPACE; SUBSTRING PROBLEM;

DATA STRUCTURES; HAMMING DISTANCE; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS;

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

References (35)

1. P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan. Geometric approximation via coresets - survey. Combinatorial and Computational Geometry (MSRI publication), 52, 2005.
2. N. Ailon and B. Chazelle. Approximate nearest neighbors and the fast johnson-lindenstrauss transform. Proceedings of the Symposium on Theory of Computing, 2006.
3. N. Alon. Problems and results in extremal combinatorics i. Discrete Mathematics, 273:31-53, 2003.
4. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. Proceedings of the Symposium on Theory of Computing, pages 20-29, 1996.
5. O. Barkol and Y. Rabani. Tighter bounds for nearest neighbor search and related problems in the cell probe model. Proceedings of the Symposium on Theory of Computing, 2000.
6. A. Borodin, R. Ostrovsky, and Y. Rabani. Lower bounds for high dimensional nearest neighbor search and related problems. Proceedings of the Symposium on Theory of Computing, 1999.
7. B. Brinkman and M. Charikar. On the impossibility of dimension reduction in 11. Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, 2003.
8. M. Bǎdoiu and K. Clarkson. Smaller core-sets for balls. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2003.
9. M. Bǎdoiu, S. Har-Peled, and P. Indyk. Approximate clustering via core-sets. Proceedings of the Symposium on Theory of Computing, 2002.
10. A. Chakrabarti, B. Chazelle, B. Gum, and A. Lvov. A lower bound on the complexity of approximate nearest-neighbor searching on the hamming cube. Proceedings of the Symposium on Theory of Computing, 1999.
11. A. Chakrabarti and O. Regev. An optimal randomised cell probe lower bounds for approximate nearest neighbor searching. Proceedings of the Symposium on Foundations of Computer Science, 2004.
12. J. Chen, X. Huang, I. Kanj, and G. Xia. Linear fpt reductions and computational lower bounds. Proceedings of the Symposium on Theory of Computing, 2004.
13. G. Cormode and S. Muthukrishnan. Improved data stream summaries: The count-min sketch and its applications. FSTTCS, 2004.
14. S. Dasgupta. Learning mixtures of gaussians. Proceedings of the Symposium on Foundations of Computer Science, pages 634-644, 1999.
15. I. Dinur. The pcp theorem by gap amplification. Proceedings of the Symposium on Theory of Computing, 2006.
16. V. Guruswami. List decoding of error-correcting codes. PhD thesis, Massachusetts Institute of Technology, August, 2001.
17. S. Har-Peled. A replacement for voronoi diagrams of near linear size. Proceedings of the Symposium on Foundations of Computer Science, 2001.
18. P. Indyk. Stable distributions, pseudorandom generators, embeddings and data stream computation. Proceedings of the Symposium on Foundations of Computer Science, 2000.
19. P. Indyk. Tutorial: Algorithmic applications of low-distortion geometric embeddings. Proceedings of the Symposium on Foundations of Computer Science, 2001.
20. P. Indyk. Nearest neighbor in high dimensional spaces. CRC Handbook of Discrete and Computational Geometry, 2nd edition, 2003.
21. P. Indyk and R. Motwani. Approximate nearest neighbor: towards removing the curse of dimensionality. Proceedings of the Symposium on Theory of Computing, 1998.
22. P. Indyk and D. Woodruff. Tight lower bounds for the distinct elements problem. Proceedings of the Symposium on Foundations of Computer Science, pages 283-290, 2003.
23. Y. Jiao, J. Xu, and M. Li. On the k-closest substring and k-consensus pattern problems. Proceedings of the Symposium on Combinatorial Pattern Matching, pages 130-144, 2004.
24. W. Johnson and J. Lindenstrauss. Extensions of lipshitz mapping into hilbert space. Contemporary Mathematics, 26:189-206, 1984.
25. N. Jones and P. Pevzner. An introduction to Bio informatics Algorithms. MIT Press, 2004.
26. E. Kushilevitz, R. Ostrovsky, and Y. Rabani. Efficient search for approximate nearest neighbor in high dimensional spaces. Proceedings of the Thirtieth ACM Symposium on Theory of Computing, pages 614-623, 1998.
27. M. Li, B. Ma, and L. Wang. On the closest string and substring problems. Journal of the ACM. Early versions appeared in STOC 99 and CPM 00., 49(2): 157-171, 2002.
28. D. Marx. The closest substring problem with small distances. Proceedings of the Symposium on Foundations of Computer Science, 2005.
29. P. B. Miltersen, N. Nisan, S. Safra, and A. Wigderson. Data structures and asymmetric communication complexity. Journal of Computer and System Sciences, 1998.
30. E. Mossel and R. O'Donnell. On the noise sensitivity of monotone functions. Random Struct. Algorithms, 23(3):333-350, 2003.
31. S. Muthukrishnan. Data streams: Algorithms and applications (invited talk at soda'03). Available at http://athos.rutgers.edu/~muthu/stream-1-1.ps, 2003.
32. R. Ostrovsky and Y. Rabani. Polynomial time approximation schemes for geometric k-clustering. Proceedings of the Symposium on Foundations of Computer Science, 2000.
33. P. Pevzner and S. Sze. Combinatorial approaches to finding subtle signals in dna sequences. International Conference on Intelligent Systems for Molecular Biology, 2000.
34. M. Pätraşcu and M. Thorup. Higher lower bounds for near-neighbor and further rich problems. Proceedings of the Symposium on Foundations of Computer Science, 2006.
35. D. Woodruff. Optimal space lower bounds for all frequency moments. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2004.