2944 search results - page 297 / 589 » Improving Bound Propagation |
184
click to vote
COMCOM
2004
15 years 6 months ago
2004
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...
146
click to vote
TIT
1998
15 years 6 months ago
1998
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain
of L, and are obtained ba...
239
click to vote
ICALP
2011
Springer
14 years 10 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
153
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by looking at their corresponding labels. T...
155
click to vote
PODS
1999
ACM
15 years 11 months ago
1999
ACM
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...