CiteULike ansobol's CiteULike Search Register Log in
CiteULike is a free online bibliography manager. Register and you can start organising your references online.
Tags

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

by: Daniel M. Gordon, Victor Miller, Peter Ostapenko
(15 Oct 2009)
Posts Export

Citation Format


View FullText article


Abstract

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.


ansobol's tags for this article


X There are no reviews yet

X Find related articles from these CiteULike users

X Find related articles with these CiteULike tags

X Posting History


X Export records

Privacy Statement | Terms & Conditions
CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.