29908 search results - page 101 / 5982 » On the complexity of communication complexity |
ICC
2009
IEEE
15 years 4 months ago
2009
IEEE
— We propose a low complexity noncoherent receiver operating at twice the symbol-rate for systems where each data symbol consists of multiple frames/chips. The receiver does not ...
SRDS
2006
IEEE
15 years 3 months ago
2006
IEEE
The paper presents a comparative performance study of the two main classes of randomized binary consensus protocols: a local coin protocol, with an expected high communication com...
GECCO
2007
Springer
15 years 4 months ago
2007
Springer
This paper explores the application of the particle swarm algorithm for a NP-hard problem in the area of wireless communications. The specific problem is of detecting symbols in a...
109
click to vote
IACR
2011
13 years 9 months ago
2011
Secure multiparty computation (MPC) allows a set of n players to compute any public function, given as an arithmetic circuit, on private inputs, so that privacy of the inputs as we...
IPSN
2005
Springer
15 years 3 months ago
2005
Springer
We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduc...