309 search results - page 49 / 62 » Communication Complexity Lower Bounds by Polynomials |
VTC
2007
IEEE
15 years 6 months ago
2007
IEEE
— 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...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
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. ...
PC
2008
14 years 11 months ago
2008
In this paper, we assess the impact of heterogeneity on scheduling independent tasks on master-slave platforms. We assume a realistic one-port model where the master can communica...
118
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract— We investigate secret key generation for a “pairwise independent network” model in which every pair of terminals observes correlated sources which are independent o...
118
click to vote
ICALP
2009
Springer
16 years 3 days ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...