On the difficulty to beat the first linear programming bound for binary codes.
Alex SamorodnitskyPublished in: CoRR (2023)
Keyphrases
- binary codes
- linear programming
- hamming distance
- efficient similarity search
- hamming space
- locality sensitive hashing
- locality sensitive
- similarity search
- optimal solution
- hash functions
- lower bound
- dynamic programming
- np hard
- pattern matching
- image collections
- high dimensional data
- low dimensional
- tag information
- pattern recognition
- hashing methods
- visual descriptors
- dimensionality reduction
- image data