Closest pair problems in very high dimensions

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

Volumn 3142, Issue , 2004, Pages 782-792

  Indyk, Piotr ^a   Lewenstein, Moshe ^b   Lipsky, Ohad ^b   Porat, Ely ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

APPROXIMATE SOLUTION; CLOSEST PAIR PROBLEM; HIGH DIMENSIONS; MATRIX MULTIPLICATION; RUNNING TIME;

ARTIFICIAL INTELLIGENCE;

EID: 33646736695     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_66     Document Type: Article

References (16)

1. K. Abrahamson. Generalized string matching. SIAM J. Computing, 16(6):1039-1051, 1987.
2. A. Amir, A. Apostolico, and M. Lewenstein. Inverse Pattern Matching. J. of Algorithms, 24(2):325-339, 1997.
3. A. Amir and M. Farach. Efficient 2-dimensional approximate matching of half-rectangular figures. Information and Computation, 118(1):1-11, 1995.
4. A. Amir, E. Porat and M. Lewenstein. Easter algorithms for string matching with k mismatches. J. of Algorithms, special SODA 2000 issue, to appear.
5. A. Borodin, R. Ostrovsky, and Y. Rabani. Subquadratic approximation algorithms for clustering problems in high dimensional spaces. Proceedings of the Symposium on Theory of Computing, 1999.
6. M. Datar, N. Immorlica, P. Indyk, and V. Mirrokni. Locality-sensitive hashing scheme based on p-stable distributions. Proc. of Symposium of Computational Geometry (SOCG), 2004, to appear.
7. M. Dubiner, Z. Galil, and E. Magen. Faster tree pattern matching. J. of the ACM, 41(2):205-213, 1994.
8. P. Indyk and R. Motwani. Approximate nearest neighbor: towards removing the curse of dimensionality. Proceedings of the Symposium on Theory of Computing, 1998.
9. P. Indyk. High-dimensional computational geometry. Ph.D. Thesis, Department of Computer Science, Stanford University, 2001.
10. R. Kosaraju. Efficient tree pattern matching. Proc. of Symosium on Foundation of Computer Science, 1990.
11. J. Kleinberg. Two algorithms for nearest-neighbor search in high dimensions. Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, 1997.
12. ∞ Metrics. Manuscript, submitted to SODA 2004.
13. S. Muthukrishnan. New results and open problems related to non-standard stringology. CPM, 1995.
14. S. Muthukrishnan and K. Palem. Non-standard stringology: algorithms and complexity. Proc. of the ACM Symposium on Theory of Computing, 770-779, 1994.
15. M. O. Rabin. Probabilistic algorithms. Algorithms and Complexity, J. F. Traub, editor. Academic Press, pages 21-39, 1976.
16. I. Shamos and J. Bentley. Divide-and-conquer in multidimensional space. Proceedings of the Symposium on Theory of Computing, pages 220-230, 1976.