350 search results - page 34 / 70 » Lower and upper bounds on obtaining history independence |
TIT
1998
14 years 11 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...
100
click to vote
INFOCOM
2002
IEEE
15 years 4 months ago
2002
IEEE
Abstract— In [1], Gupta and Kumar determined the capacity of wireless networks under certain assumptions, among them point-to-point coding, which excludes for example multi-acces...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We consider bandit problems involving a large (possibly infinite) collection of arms, in which the expected reward of each arm is a linear function of an r-dimensional random vect...
MST
2002
14 years 11 months ago
2002
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
106
click to vote
CONCUR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithme...