104 search results - page 20 / 21 » The Partition Bound for Classical Communication Complexity a... |
SIGMOD
2010
ACM
13 years 11 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
EDBT
2006
ACM
14 years 6 months ago
2006
ACM
Abstract. Sensor networks monitor physical phenomena over large geographic regions. Scientists can gain valuable insight into these phenomena, if they understand the underlying dat...
DMSN
2007
ACM
13 years 10 months ago
2007
ACM
This paper assumes a set of n mobile sensors that move in the Euclidean plane as a swarm1 . Our objectives are to explore a given geographic region by detecting and aggregating sp...
DEDS
2008
13 years 6 months ago
2008
Network calculus offers powerful tools to analyze the performances in communication networks, in particular to obtain deterministic bounds. This theory is based on a strong mathema...
FOCS
2007
IEEE
13 years 10 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...