Beating the Probabilistic Lower Bound on q-Perfect Hashing.
Chaoping XingChen YuanPublished in: Comb. (2023)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- objective function
- np hard
- data driven
- optimal solution
- generative model
- worst case
- probabilistic model
- branch and bound
- data structure
- order preserving
- training set
- posterior probability
- uncertain data
- random projections
- upper and lower bounds
- locality sensitive hashing
- linear programming relaxation
- file organization