Note on distance matrix hashing

01/24/2019

∙

Hashing algorithm of dynamical set of distances is described. Proposed hashing function is residual. Data structure which implementation accelerates computations is presented

READ FULL TEXT

Note on distance matrix hashing

Supervised Discrete Hashing

Sliding Block Hashing (Slick) – Basic Algorithmic Ideas

Note on Generalized Cuckoo Hashing with a Stash

CRH: A Simple Benchmark Approach to Continuous Hashing

Another Proof of Cuckoo hashing with New Variants

Parameterizing Kterm Hashing

Generic LSH Families for the Angular Distance Based on Johnson-Lindenstrauss Projections and Feature Hashing LSH

Note on distance matrix hashing

Related Research

Supervised Discrete Hashing

Sliding Block Hashing (Slick) – Basic Algorithmic Ideas

Note on Generalized Cuckoo Hashing with a Stash

CRH: A Simple Benchmark Approach to Continuous Hashing

Another Proof of Cuckoo hashing with New Variants

Parameterizing Kterm Hashing

Generic LSH Families for the Angular Distance Based on Johnson-Lindenstrauss Projections and Feature Hashing LSH