4894 search results - page 220 / 979 » Choices |
156
click to vote
CCR
2008
15 years 7 months ago
2008
Rate control protocols that utilise explicit feedback from routers are able to achieve fast convergence to an equilibrium which approximates processor-sharing on a single bottlene...
135
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
A solution to a problem of Erdos, Rubin and Taylor is obtained by showing that if a graph G is (a : b)-choosable, and c/d > a/b, then G is not necessarily (c : d)-choosable. Th...
182
click to vote
DCC
2010
IEEE
15 years 7 months ago
2010
IEEE
In [8], the authors formulate new coset bounds for algebraic geometric codes. The bounds give improved lower bounds for the minumum distance of algebraic geometric codes as well a...
175
click to vote
AAECC
2006
Springer
15 years 7 months ago
2006
Springer
Cyclicity of a convolutional code (CC) is relying on a nontrivial automorphism of the algebra F[x]/(xn - 1), where F is a finite field. A particular choice of the data leads to th...
144
click to vote
AAI
2006
15 years 7 months ago
2006
In the analysis of a newspaper page an important step is the clustering of various text blocks into logical units, i.e., into articles. We propose three algorithms based on text p...