Login / Signup

Coloring Hamming Graphs, Optimal Binary Codes, and the 0/1-Borsuk Problem in Low Dimensions.

Günter M. Ziegler
Published in: Computational Discrete Mathematics (2001)
Keyphrases
  • hamming distance
  • binary codes
  • graph matching
  • dynamic programming
  • neural network
  • distance measure
  • pattern matching
  • database
  • training data
  • kernel function