Login / Signup
Fast hashing with strong concentration bounds.
Anders Aamand
Jakob Bæk Tejs Knudsen
Mathias Bæk Tejs Knudsen
Peter Michael Reichstein Rasmussen
Mikkel Thorup
Published in:
STOC (2020)
Keyphrases
</>
upper bound
error bounds
data structure
lower bound
worst case
lower and upper bounds
high level
order preserving
upper and lower bounds
hashing algorithm
learning algorithm
nearest neighbor search
vc dimension
hamming distance
multi class
search algorithm
artificial intelligence