524 search results - page 76 / 105 » An Optimal Lower Bound on the Communication Complexity of Ga... |
135
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
176
click to vote
LFCS
2007
Springer
16 years 7 days ago
2007
Springer
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
177
click to vote
IPPS
2009
IEEE
16 years 23 days ago
2009
IEEE
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
147
click to vote
ICC
2007
IEEE
16 years 13 days ago
2007
IEEE
—The full-complexity soft-input/soft-output (SISO) multiuser detector based on the a posteriori probability (APP) algorithm has a computational complexity growing exponentially w...
152
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, we consider an automatic-repeat-request (ARQ) retransmission protocol signaling over a block-fading multiple-input, multiple-output (MIMO) channel. Unlike previous ...