New upper bounds for (b, k)-hashing.
Stefano Della FioreSimone CostaMarco DalaiPublished in: ISIT (2021)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- order preserving
- worst case
- hash functions
- tight bounds
- branch and bound
- similarity search
- file organization
- lower and upper bounds
- data structure
- nearest neighbor search
- linear hashing
- hash tables
- sample complexity
- hashing algorithm
- error probability
- gray code
- random projections
- branch and bound algorithm
- hamming distance
- generalization error
- approximate nearest neighbor search
- video copy detection
- sample size
- efficiently computable
- hash table
- locality sensitive
- dimensionality reduction