IEEE Transactions on Information Theory · 2010 · 12 citations · 14 references
ComputingComputer EngineeringComputer ScienceAlgorithmsComputational GeometryData StructuresApproximation AlgorithmsCoding TheoryError-correcting CodesHash FunctionsHash TablesNearest Neighbor SearchHash Function AnalysisHash Function DesignHashingLocality-sensitive HashingMetrics
<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> One way to find near-matches in large datasets is to use hash functions. In recent years locality-sensitive hash functions for various metrics have been given; for the Hamming metric projecting onto <emphasis emphasistype="italic"><formula formulatype="inline"><tex Notation="TeX">$k$</tex></formula></emphasis> 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 error-correcting codes work better, and asymptotically random codes perform better than projection. </para>
14
The Magma Algebra System I: The User Language
Wieb Bosma, John Cannon, Catherine Playoust · Journal of Symbolic Computation · 1997 · 7.4K citations
Piotr Indyk, Rajeev Motwani · 1998 · 4.2K citations · Full text
Information Theory and Reliable Communication
David A. Bell · Electronics and Power · 1969 · 4K citations
Similarity Search in High Dimensions via Hashing
Aristides Gionis, Piotr Indyk, Rajeev Motwani · 1999 · 3.1K citations