489 search results - page 34 / 98 » Communication Complexity of Permutation-Invariant Functions |
100
click to vote
CC
2010
Springer
14 years 8 months ago
2010
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
66
Voted
VLSID
2005
IEEE
15 years 11 months ago
2005
IEEE
Designing NoC-based systems has become increasingly complex with support for multiple functionalities. Decisions regarding interconnections between the heterogeneous system compon...
SIGSOFT
2009
ACM
15 years 11 months ago
2009
ACM
A large number of industrial concurrent programs are being designed based on a model which combines threads with event-based communication. These programs consist of several threa...
INFOCOM
2010
IEEE
14 years 9 months ago
2010
IEEE
—This paper considers the problem of designing scheduling algorithms for multi-channel (e.g., OFDM) wireless downlink networks with n users/OFDM sub-channels. For this system, wh...
TCC
2010
Springer
15 years 7 months ago
2010
Springer
Goldreich-Krawczyk (Siam J of Comp’96) showed that only languages in BPP have constant-round public-coin black-box zero-knowledge protocols. We extend their lower bound to “ful...