On Delsarte's Linear Programming Bounds for Binary Codes.
Michael NavonAlex SamorodnitskyPublished in: FOCS (2005)
Keyphrases
- binary codes
- linear programming
- hamming distance
- linear program
- efficient similarity search
- similarity search
- hamming space
- lower bound
- locality sensitive hashing
- dynamic programming
- optimal solution
- image collections
- locality sensitive
- visual descriptors
- hash functions
- low dimensional
- high dimensional data
- np hard
- high dimensional
- multi dimensional
- neural network
- pattern matching
- hyperplane
- text classification
- objective function
- keywords
- tag information
- computer vision