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

Daniel M. Gordon, Victor Miller, Peter Ostapenko

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-cub…