Sciweavers

287 search results - page 46 / 58
» Communication complexity as a lower bound for learning in ga...
Sort
View
VTC
2007
IEEE
133views Communications» more  VTC 2007»
14 years 2 months ago
Decode-and-Forward Cooperative Networks with Relay Selection
— In this paper, we focus on the diversity order of the decode-and-forward (DF) cooperative networks with relay selection. Many detection schemes have been proposed for the DF; b...
Zhihang Yi, Il-Min Kim
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 8 months ago
The price of certainty: "waterslide curves" and the gap to capacity
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...
Anant Sahai, Pulkit Grover
ICT
2004
Springer
130views Communications» more  ICT 2004»
14 years 2 months ago
Rayleigh Fading Multiple Access Channel Without Channel State Information
— In this paper we determine bounds of the capacity region of a two-user multipleaccess channel with Rayleigh fading when neither the transmitters nor the receiver has channel st...
Ninoslav Marina
INFOCOM
2002
IEEE
14 years 1 months ago
On the capacity of wireless networks: The relay case
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...
Michael Gastpar, Martin Vetterli
EUC
2007
Springer
14 years 2 months ago
Consensus-Driven Distributable Thread Scheduling in Networked Embedded Systems
We demonstrate an improved consensus-driven utility accrual scheduling algorithm (DUA-CLA) for distributable threads which execute under run-time uncertainties in execution time, ...
Jonathan Stephen Anderson, Binoy Ravindran, E. Dou...