489 search results - page 60 / 98 » Communication Complexity of Permutation-Invariant Functions |
118
click to vote
TRIDENTCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
The Internet enables the way how global businesses and communities communicate today. In the last years, however, new demands have collided with old designs, resulting in a complex...
130
Voted
DRM
2006
Springer
15 years 4 months ago
2006
Springer
In this paper we consider the functionality that a rights expression language (REL) should provide within a digital rights management (DRM) environment. We begin by noting the dea...
101
Voted
COCO
2005
Springer
15 years 2 months ago
2005
Springer
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
108
Voted
ATAL
2003
Springer
15 years 5 months ago
2003
Springer
Decentralized control of a cooperative multi-agent system is the problem faced by multiple decision-makers that share a common set of objectives. The decision-makers may be robots...
PKC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...