Optimal hash functions for approximate closest pairs on the n-cube

Details Optimal hash functions for approximate closest pairs on the n-cube Optimal hash functions for approximate closest pairs on the n-cube

2008-06-20

arxiv.org/abs/0806.3284v2

Computer Science

Information Theory

IEEE Transactions on Information Theory, to appear

Scientific paper

One way to find closest pairs in large datasets is to use hash functions. In recent years locality-sensitive hash functions for various metrics have been given: projecting an n-cube onto k bits is simple hash function that performs well. In this paper we investigate alternatives to projection. For various parameters hash functions given by complete decoding algorithms for codes work better, and asymptotically random codes perform better than projection.

Affiliated with

Also associated with

No associations

Rating

Optimal hash functions for approximate closest pairs on the n-cube does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal hash functions for approximate closest pairs on the n-cube, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal hash functions for approximate closest pairs on the n-cube will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-370572