254 search results - page 41 / 51 » On randomized one-round communication complexity |
ASIACRYPT
2009
Springer
14 years 2 months ago
2009
Springer
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—Multiple-input multiple-output (MIMO) channels have been studied from various aspects including the average of the mutual information between the transmitter and receiver (ergod...
AINA
2007
IEEE
14 years 2 months ago
2007
IEEE
Nodes in sensor fields and in autonomous swarms of mobile robots need to communicate; this usually requires individual nodes to either consume a significant amount of energy, ca...
CISS
2007
IEEE
14 years 2 months ago
2007
IEEE
— In wireless ad hoc networks, distributed nodes can collaboratively form an antenna array for long-distance communications to achieve high energy efficiency. In recent work, Oc...