168 search results - page 29 / 34 » Lower Bounds for Distributed Coin-Flipping and Randomized Co... |
VTC
2007
IEEE
15 years 3 months ago
2007
IEEE
—This paper presents an opportunistic feedback (OF) protocol that achieves the asymptotic sum-capacity of the fading broadcast channel (BC) with a limited amount of feedback. The...
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
JSAC
2008
14 years 9 months ago
2008
We consider a wireless collision channel, shared by a finite number of users who transmit to a common base station. Each user wishes to minimize its average transmission rate (or p...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Abstract—We derive a simple general parametric representation of the rate–distortion function of a memoryless source, where both the rate and the distortion are given by integr...
104
click to vote
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
In this paper, we derive concentration of measure inequalities for compressive Toeplitz matrices (having fewer rows than columns) with entries drawn from an independent and identic...