29908 search results - page 37 / 5982 » On the complexity of communication complexity |
176
click to vote
GLOBECOM
2007
IEEE
16 years 10 days ago
2007
IEEE
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
171
click to vote
ASIACRYPT
2001
Springer
15 years 10 months ago
2001
Springer
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
165
click to vote
ECCC
2008
15 years 6 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
160
click to vote
LATA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS) as formalizations of the ling...
143
click to vote
GLOBECOM
2009
IEEE
16 years 23 days ago
2009
IEEE
Abstract—In this paper, we consider the Bayesian CramerRao bound (BCRB) for the dynamical estimation of multi-path Rayleigh channel complex gains in data-aided (DA) and non-dataa...