Soft decoding techniques for codes and Lattices, including the Golay code and the Leech Lattice
IEEE Transactions on Information Theory
An optimal algorithm for approximate nearest neighbor searching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Approximating a Finite Metric by a Small Number of Tree Metrics
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
In this paper, we present DLSH Distributed Locality Sensitive Hashing, a similar-data search technology. The huge growth in the size of video content has broken the traditional multi-media index hosting and look-up solutions, these are not able to scale to the size of the current and projected index requirements. Distributed LSH (D-LSH) addresses this need of a highly scalable multi-media index. DLSH performs better for finding approximate near neighbors on extremely large scales, as DLSH distributes close points on single boxes, and far points on different boxes based on projections.