4616 search results - page 34 / 924 » The Communication Complexity of Correlation |
FAW
2009
Springer
14 years 10 days ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
SSS
2009
Springer
14 years 7 days ago
2009
Springer
A snap-stabilizing protocol, starting from any configuration, always behaves according to its specification. In this paper, we are interested in message forwarding problem in a m...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— In this paper differential space–frequency modulation (DSFM) for transmission over multiple–input multiple– output channels using orthogonal frequency division mu...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
SSDBM
2006
IEEE
14 years 1 months ago
2006
IEEE
The detection of correlations between different features in high dimensional data sets is a very important data mining task. These correlations can be arbitrarily complex: One or...