489 search results - page 13 / 98 » Communication Complexity of Permutation-Invariant Functions |
ECCC
2008
14 years 10 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
ICC
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we investigate the low-complexity synchronization design for multi-band orthogonalfrequency-division-multiplexing (MB-OFDM) ultra-wideband (UWB) systems. We propose...
CASCON
1996
14 years 11 months ago
1996
The performance of host communication subsystems is an important research topic in computer networks.1 Performance metrics such as throughput, delay, and packet loss are important...
AIPS
2008
15 years 21 days ago
2008
We consider the problem of cooperative multiagent planning under uncertainty, formalized as a decentralized partially observable Markov decision process (Dec-POMDP). Unfortunately...
SC
1995
ACM
15 years 1 months ago
1995
ACM
This paper de nes and describes the properties of a multicast virtual topology, the M-array, and a resource-ecient variation, the REM-array. It is shown how several collective op...