On finding the closest bitwise matches in a fixed set

Authors:
Peter Klier;Richard J. Fateman
Affiliations:
Univ. of California at Berkeley;Univ. of California at Berkeley
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1991

Citing 7
Cited 0

Artificial intelligence (2nd ed.)

Artificial intelligence (2nd ed.)
Gray Codes for Partial Match and Range Queries

IEEE Transactions on Software Engineering
An Algorithm for Finding Best Matches in Logarithmic Expected Time

ACM Transactions on Mathematical Software (TOMS)
Optimal Expected-Time Algorithms for Closest Point Problems

ACM Transactions on Mathematical Software (TOMS)
Signature files: an access method for documents and its analytical performance evaluation

ACM Transactions on Information Systems (TOIS)
Elements of the Theory of Computation

Elements of the Theory of Computation
HAKMEM

HAKMEM

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a given large fixed table of bit-vectors, we would like to find, as rapidly as possible, those bit-vectors which have the least Hamming distances from a newly-presented arbitrary bit-vector.