202 search results - page 14 / 41 » Counting Distance Permutations |
DCC
2001
IEEE
16 years 2 months ago
2001
IEEE
A method for demonstrating and enumerating uniformly efficient (permutation-optimal) trellis decoders for self-dual codes of high minimum distance is developed. Such decoders and c...
132
click to vote
TIT
2010
14 years 9 months ago
2010
We investigate error-correcting codes for a the rank-modulation scheme with an application to flash memory devices. In this scheme, a set of n cells stores information in the permu...
137
click to vote
SIAMJO
2010
14 years 10 months ago
2010
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
148
click to vote
WACV
2005
IEEE
15 years 8 months ago
2005
IEEE
In this paper we propose an approach to count the number of pedestrians, given a trajectory data set provided by a tracking system. The tracking process itself is treated as a bla...
171
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...