Login / Signup
Improved semidefinite programming bounds for binary codes by split distance enumerations.
Pin-Chieh Tseng
Ching-Yi Lai
Wei-Hsuan Yu
Published in:
ISIT (2022)
Keyphrases
</>
semidefinite programming
hamming distance
binary codes
linear programming
primal dual
maximum margin
upper bound
hash functions
lower bound
distance measure
kernel matrix
similarity search
pattern matching
distance function
learning algorithm
worst case
text categorization
similarity measure