Key points are not available for this paper at this time.
A new method of hash coding is presented and is shown to possess desirable attributes. Specifically, the algorithm is simple, efficient, and exhaustive, while needing little time per probe and using few probes per lookup. Performance data and implementation hints are also given.
Building similarity graph...
Analyzing shared references across papers
Loading...
Bell et al. (Sun,) studied this question.
www.synapsesocial.com/papers/6a07ee5509b3c820153787b3 — DOI: https://doi.org/10.1145/362790.362797
James Bell
Charles H. Kaman
Communications of the ACM
Digital Equipment (Germany)
Building similarity graph...
Analyzing shared references across papers
Loading...