4616 search results - page 13 / 924 » The Communication Complexity of Correlation |
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
COCO
2010
Springer
13 years 11 months ago
2010
Springer
COCO
2008
Springer
13 years 9 months ago
2008
Springer
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—Modern networks are complex and hence, network operators often rely on automation to assist in assuring the security, availability, and performance of these networks. At the cor...
GI
2007
Springer
14 years 1 months ago
2007
Springer
: State-of-the-art interoperability between heterogeneous systems on a technical level builds on services oriented architectures (SOA) for a given problem space. Semantics can be i...