Login / Signup
Random linear binary codes have smaller list sizes than uniformly random binary codes.
Ray Li
Mary Wootters
Published in:
CoRR (2018)
Keyphrases
</>
binary codes
hamming distance
simple linear
efficient similarity search
hash functions
similarity search
hamming space
nearest neighbor
locality sensitive hashing
visual descriptors
locality sensitive
pattern matching
image processing
computer vision
high dimensional data
high level
machine learning