489 search results - page 9 / 98 » Communication Complexity of Permutation-Invariant Functions |
GLOBECOM
2007
IEEE
15 years 2 months ago
2007
IEEE
Accurate and systematic channel simulation technique is critical for performance verification of digital transceiver design over wireless channels. Despite the abundant results on ...
FGCS
2007
14 years 10 months ago
2007
Grid computing is a newly developed technology for complex systems with large-scale resource sharing and multi-institutional collaboration. The prominent feature of grid computing...
ASIACRYPT
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
ITA
2006
14 years 10 months ago
2006
Abstract. We compare various computational complexity classes defined within the framework of membrane systems, a distributed parallel computing device which is inspired from the f...
84
Voted
ICALP
2003
Springer
15 years 3 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...