Linear Programming Bounds for Almost-Balanced Binary Codes.
Venkatesan GuruswamiAndrii RiazanovPublished in: CoRR (2021)
Keyphrases
- binary codes
- linear programming
- hamming distance
- linear program
- hamming space
- efficient similarity search
- similarity search
- lower bound
- locality sensitive hashing
- optimal solution
- np hard
- hash functions
- dynamic programming
- objective function
- high dimensional
- locality sensitive
- search engine
- data mining
- image collections
- distance measure
- image data
- data sets