Tight Relative 2- and 4-Designs on Binary Hamming Association Schemes.
Zengti LiEiichi BannaiEtsuko BannaiPublished in: Graphs Comb. (2014)
Keyphrases
- computer vision
- hamming distance
- upper bound
- worst case
- image processing
- machine learning
- lower bound
- encoding schemes
- distance measure
- decision trees
- artificial neural networks
- special case
- search algorithm
- multi class
- image sequences
- image classification
- pattern matching
- design principles
- information systems
- binary tree
- real time