Locality-preserving hashing in multidimensional spaces (1997) [40 citations — 2 self]
Download:
|
|
by Piotr Indyk, Rajeev Motwani, Prabhakar Raghavan, Santosh Vempala
In Proceedings of the 29th ACM Symposium on Theory of Computing
http://theory.stanford.edu/~rajeev/postscripts/hashing.ps.gz
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Indyk97locality-preservinghashing,author = {Piotr Indyk and Rajeev Motwani and Prabhakar Raghavan and Santosh Vempala},
title = {Locality-preserving hashing in multidimensional spaces},
booktitle = {In Proceedings of the 29th ACM Symposium on Theory of Computing},
year = {1997},
pages = {618--625}
}
Years of Citing Articles
Abstract:
We consider locality-preserving hashing--- in which adjacent points in the domain are mapped to adjacent or nearlyadjacent points in the range--- when the domain is a d-dimensional cube. This problem has applications to highdimensional search and multimedia indexing. We show that simple and natural classes of hash functions are provably good for this problem. We complement this with lower bounds suggesting that our results are essentially the best possible. 1
