Redundant Bit Vectors for Quickly Searching High-Dimensional Regions
- 1 January 2005
- conference paper
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 137-158
- https://doi.org/10.1007/11559887_9
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Locality-sensitive hashing scheme based on p-stable distributionsPublished by Association for Computing Machinery (ACM) ,2004
- Distortion discriminant analysis for audio fingerprintingIEEE Transactions on Speech and Audio Processing, 2003
- Similarity indexing with the SS-treePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Deflating the dimensionality curse using multiple fractal dimensionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A Fragment-Based Approach to Object Representation and ClassificationLecture Notes in Computer Science, 2001
- Database-friendly random projectionsPublished by Association for Computing Machinery (ACM) ,2001
- 10.1162/15324430260185583Applied Physics Letters, 2000
- When Is “Nearest Neighbor” Meaningful?Lecture Notes in Computer Science, 1999
- Approximate range searchingPublished by Association for Computing Machinery (ACM) ,1995
- R-treesPublished by Association for Computing Machinery (ACM) ,1984