658 search results - page 118 / 132 » Lower bounds for sorting networks |
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
—We aim to characterize the maximum link throughput of a multi-channel opportunistic communication system. The states of these channels evolve as independent and identically dist...
ICMCS
2007
IEEE
14 years 1 months ago
2007
IEEE
In a Wyner-Ziv video coding system based on turbo codes, parity bits are generated for a Wyner-Ziv frame and transmitted to the decoder. In this context of distributed source codi...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
The dynamic TCP acknowledgement problem formulated by Dooly et al. has been intensively studied in the area of competitive analysis. However, their framework does not consider the ...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— Low analyzes the equilibrium performance of the recently developed eXplicit Control Protocol (XCP) by applying the derived window-based dynamical model. However, Low’s window...