Sciweavers

20294 search results - page 399 / 4059
» Algorithmic Information Theory
Sort
View
IPL
2002
93views more  IPL 2002»
15 years 7 months ago
Storing information with extractors
We deal with the problem of storing a set of K elements that are taken from a large universe of size N, such that membership in the set can be determined with high probability by ...
Amnon Ta-Shma
176
Voted
SENSYS
2010
ACM
15 years 5 months ago
Estimating building consumption breakdowns using ON/OFF state sensing and incremental sub-meter deployment
This paper considers the problem of estimating the power breakdowns for the main appliances inside a building using a small number of power meters and the knowledge of the ON/OFF ...
Deokwoo Jung, Andreas Savvides
DCOSS
2006
Springer
15 years 11 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
PODC
2006
ACM
16 years 1 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
MOBIHOC
2004
ACM
16 years 7 months ago
Internal synchronization of drift-constraint clocks in ad-hoc sensor networks
Clock synchronization is a crucial basic service in typical sensor networks, since the observations of distributed sensors more often than not need to be ordered ("a happened...
Lennart Meier, Philipp Blum, Lothar Thiele