101 search results - page 3 / 21 » The Intractability of Computing the Hamming Distance |
GC
2008
Springer
14 years 9 months ago
2008
Springer
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...
65
Voted
AAECC
2007
Springer
15 years 3 months ago
2007
Springer
Let Fn be the binary n-cube, or binary Hamming space of dimension n, endowed with the Hamming distance, and En (respectively, On ) the set of vectors with even (respectively, odd)...
89
Voted
DSN
2002
IEEE
15 years 2 months ago
2002
IEEE
Standardized 32-bit Cyclic Redundancy Codes provide fewer bits of guaranteed error detection than they could, achieving a Hamming Distance (HD) of only 4 for maximum-length Ethern...
89
Voted
DNA
2004
Springer
15 years 2 months ago
2004
Springer
A very basic problem in all DNA computations is finding a good encoding. Apart from the fact that they must provide a solution, the strands involved should not exhibit any undesir...
CPM
2000
Springer
15 years 1 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...