Locality-sensitive hashing scheme based on p-stable distributions
- 8 June 2004
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 253-262
- https://doi.org/10.1145/997817.997857
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Finding nearest neighbors in growth-restricted metricsPublished by Association for Computing Machinery (ACM) ,2002
- Provably sensitive Indexing strategies for biosequence similarity searchPublished by Association for Computing Machinery (ACM) ,2002
- Efficient large-scale sequence comparison by locality-sensitive hashingBioinformatics, 2001
- Finding motifs using random projectionsPublished by Association for Computing Machinery (ACM) ,2001
- Approximate nearest neighborsPublished by Association for Computing Machinery (ACM) ,1998
- Efficient search for approximate nearest neighbor in high dimensional spacesPublished by Association for Computing Machinery (ACM) ,1998
- Two algorithms for nearest-neighbor search in high dimensionsPublished by Association for Computing Machinery (ACM) ,1997
- Nearest neighbor queries in metric spacesPublished by Association for Computing Machinery (ACM) ,1997
- One-Dimensional Stable DistributionsPublished by American Mathematical Society (AMS) ,1986
- A Method for Simulating Stable Random VariablesJournal of the American Statistical Association, 1976