Indyk, P., Motwani, R.: Approximate nearest neighbors: Towards removing the curse of dimensionality. In: Proc. of STOC, Dallas, TX (1998) 604--613 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Improving Random Projections Using Marginal Information - Ping Li Trevor (Correct)
No context found.
Indyk, P., Motwani, R.: Approximate nearest neighbors: Towards removing the curse of dimensionality. In: Proc. of STOC, Dallas, TX (1998) 604--613
A Sketch-based Sampling Algorithm on Sparse Data - Ping Li Pingli (Correct)
No context found.
Piotr Indyk and Rajeev Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proc. of STOC, pages 604--613, Dallas, TX, 1998.
Practical Procedures for Dimension Reduction in l_1 - Li, Hastie, Church (Correct)
No context found.
Piotr Indyk and Rajeev Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proc. of STOC, pages 604--613, Dallas, TX, 1998.
Randomised Rough-Terrain Robot Motion Planning - Ettlin, Bleuler (2006) (Correct)
No context found.
P. Indyk and R. Motwani, "Approximate nearest neighbors: towards removing the curse of dimensionality," in Proceedings of 30th ACM Symposium on Theory of Computing, 1998, pp. 604--613.
Scalable Recognition with a Vocabulary Tree - David Nister And (Correct)
No context found.
P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In 30th Ann. ACM Symp. on Theory of Computing, 1998.
Self-Organizing Maps for Structured Data - Hagenbuchner Sperduti And (Correct)
No context found.
P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proc. 30th Symposium on Theory of Computing (STOC'98), pages 604--613, 1998.
Tracking Web Spam with Hidden Style Similarity - Tanguy Urvoy Thomas (2006) (Correct)
No context found.
P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proc. of 30th STOC, pages 604--613, 1998.
Stable Interest Points for Improved ImageRetrieval and Matching - Johnson, Cipolla (2006) (Correct)
No context found.
Piotr Indyk and Rajeev Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proceedings of the 30th Symposium on Theory of Computing, pages 604--613, 1998.
Randomized Kinodynamic Planning - Steven Lavalle James (1999) (66 citations) (Correct)
No context found.
P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998.
An Investigation of Practical Approximate Nearest Neighbor .. - Liu, Moore, Gray, Yang (1 citation) (Correct)
No context found.
P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In STOC, pages 604--613, 1998.
Random Projection, Margins, Kernels, and - Feature-Selection Avrim Blum (Correct)
No context found.
P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 604--613, 1998. 16
Kernels as Features: On Kernels, Margins, and.. - Balcan, Blum, Vempala (2004) (Correct)
No context found.
P. Indyk and R. Motwani, "Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality," Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 604--613, 1998.
Multi-dimensional Range Queries in Sensor Networks - Xin Li Young (2003) (11 citations) (Correct)
No context found.
P. Indyk and R. Motwani. Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, Dallas, Texas, May 1998.
Experiments with Random Projections for Machine Learning - Fradkin, Madigan (2003) (1 citation) (Correct)
No context found.
P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proceedings of the 30th Annual ACM STOC, pages 604--613, 1998.
Computer Vision for Music Identification - Yan Ke Derek (2005) (Correct)
No context found.
P. Indyk and R. Motwani. Approximate nearest neighbor -- towards removing the curse of dimensionality. In Proceedings of Symposium on Theory of Computing, 1998.
Nearest Neighbour Search in Hausdorff Distance Pattern Spaces - Braß, Knauer (2001) (Correct)
No context found.
P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proc. 30th Annu. ACM Sympos. Theory Comput., pages 604-613, 1998.
Locally Consistent Parsing and Applications to - Approximate String Comparisons (Correct)
No context found.
Piotr Indyk and Rajeev Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In STOC, pages 604--613, 1998.
Semantic Similarity between Search Engine Queries Using.. - Chien, Immorlica (2005) (Correct)
No context found.
P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Thirtieth Annual ACM Symposium on the Theory of Computing, Dallas, Texas, USA, 1998.
LSH Forest: Self-Tuning Indexes for Similarity Search - Mayank Bawa Bawa (2005) (Correct)
No context found.
P. Indyk and R. Motwani. Approximate nearest neighbor - towards removing the curse of dimensionality. In Proc. of STOC, 1998.
An improved bound on Boolean matrix multiplication for.. - Gasieniec, Lingas (Correct)
No context found.
P. Indyk and R. Motwani. Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. Proceedings of the 30th ACM Symposium on Theory of Computing, 1998.
Polynomial Time Approximation Schemes for Geometric k-Clustering - Ostrovsky, Rabani (2001) (10 citations) (Correct)
No context found.
P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proc. of 30th STOC, pp. 604-613, 1998.
Lower Bounds for High Dimensional Nearest Neighbor.. - Borodin, Ostrovsky.. (1999) (23 citations) (Correct)
No context found.
P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proc. of 30th STOC, 1998.
Exploring Bit-Difference for Approximate KNN Search in.. - Cui, Shen, Shen, Tan (2005) (1 citation) (Correct)
No context found.
P. Indyk and R. Motwani (1998), Approximate nearest neighbors: towards removing the curse of dimensionality, Proc. 30th ACM STOC Conference, pp. 604--613.
LSH Forest: Self-Tuning Indexes for Similarity Search - Bawa, Condie, Ganesan (2005) (Correct)
No context found.
P. Indyk and R. Motwani. Approximate nearest neighbor - towards removing the curse of dimensionality. In Proc. of STOC, 1998.
Semantic Similarity between Search Engine Queries Using.. - Chien, Immorlica (2005) (Correct)
No context found.
P. Indyk and R. Motwani. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Thirtieth Annual ACM Symposium on the Theory of Computing, Dallas, Texas, USA, 1998.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC