Beating the probabilistic lower bound on perfect hashing.
Chaoping XingChen YuanPublished in: Electron. Colloquium Comput. Complex. (2019)
Keyphrases
- lower bound
- upper bound
- bayesian networks
- branch and bound algorithm
- objective function
- probabilistic model
- branch and bound
- uncertain data
- optimal solution
- upper and lower bounds
- lower and upper bounds
- hash functions
- worst case
- sufficiently accurate
- nearest neighbor search
- random projections
- data driven
- np hard
- search algorithm
- data structure