Beating the probabilistic lower bound on perfect hashing.
Chaoping XingChen YuanPublished in: CoRR (2019)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- np hard
- generative model
- bayesian networks
- branch and bound
- constant factor
- upper and lower bounds
- lower and upper bounds
- data driven
- objective function
- multi dimensional
- worst case
- probabilistic model
- information theoretic
- posterior probability
- optimal solution
- nearest neighbor search
- probabilistic logic
- dimensionality reduction
- similarity search
- feature space
- computational complexity
- uncertain data
- hash functions
- neural network