327 search results - page 40 / 66 » Algorithms for infinite huffman-codes |
DAM
2010
13 years 7 months ago
2010
Given a set of m identical bins of size 1, the online input consists of a (potentially, infinite) stream of items in (0, 1]. Each item is to be assigned to a bin upon arrival. The ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
It is known that the expansion property of a graph influences the performance of the corresponding code when decoded using iterative algorithms. Certain graph products may be used ...
JGT
2006
13 years 7 months ago
2006
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...
COMBINATORICS
2004
13 years 7 months ago
2004
In 1958, Richard Guy proved that the number of partitions of n into odd parts greater than one equals the number of partitions of n into distinct parts with no powers of 2 allowed...
JSC
2008
13 years 5 months ago
2008
We compute the singular points of a plane rational curve, parametrically given, using the implicitization matrix derived from the -basis of the curve. It is shown that singularity...