New upper bounds for (b, k)-hashing.
Stefano Della FioreSimone CostaMarco DalaiPublished in: CoRR (2021)
Keyphrases
- upper bound
- lower bound
- tight bounds
- upper and lower bounds
- file organization
- order preserving
- branch and bound
- lower and upper bounds
- worst case
- data structure
- hash functions
- nearest neighbor search
- branch and bound algorithm
- hashing algorithm
- hash tables
- generalization error
- locality sensitive
- linear hashing
- locality sensitive hashing
- constant factor
- sample size
- similarity search
- tight upper and lower bounds
- random projections
- upper bounding
- error probability
- gray code
- nearest neighbor
- hashing methods
- neural network