Sciweavers

ECCC
2006
99views more  ECCC 2006»
13 years 11 months ago
On the Subgroup Distance Problem
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
Christoph Buchheim, Peter J. Cameron, Taoyang Wu
ARSCOM
2007
76views more  ARSCOM 2007»
13 years 11 months ago
A New Lower Bound for A(17, 6, 6)
We construct a record-breaking binary code of length 17, minimal distance 6, constant weight 6, and containing 113 codewords.
Yeow Meng Chee
CVPR
2003
IEEE
15 years 27 days ago
Classification Based on Symmetric Maximized Minimal Distance in Subspace (SMMS)
We introduce a new classification algorithm based on the concept of Symmetric Maximized Minimal distance in Subspace (SMMS). Given the training data of authentic samples and impos...
Wende Zhang, Tsuhan Chen