104 search results - page 18 / 21 » The Partition Bound for Classical Communication Complexity a... |
129
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— For a wide variety of sensor network environments, location information is unavailable or expensive to obtain. We propose a location-free, lightweight, distributed, and data-ce...
137
Voted
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract-- Optimal communication/control analysis and design of dynamical controlled systems, when there are finite capacity communication constraints often involve information and...
106
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
194
Voted
SIGMOD
2007
ACM
16 years 3 months ago
2007
ACM
Commercial enterprise data warehouses are typically implemented on parallel databases due to the inherent scalability and performance limitation of a serial architecture. Queries ...
137
Voted
STOC
2009
ACM
16 years 4 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...