Further strengthening of upper bounds for perfect k-Hashing.
Stefano Della FioreSimone CostaMarco DalaiPublished in: CoRR (2020)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- worst case
- lower and upper bounds
- tight bounds
- branch and bound
- file organization
- hash functions
- order preserving
- data structure
- sample size
- generalization error
- hash tables
- sample complexity
- approximate nearest neighbor search
- branch and bound algorithm
- video copy detection
- gray code
- tight upper and lower bounds
- data sets
- concept classes
- vc dimension
- random projections
- hamming distance
- hash table
- permutation flowshop
- error probability
- similarity search
- efficiently computable
- upper bounding
- optimal solution