279 search results - page 54 / 56 » Randomized k-Coverage Algorithms For Dense Sensor Networks |
PODS
2006
ACM
14 years 7 months ago
2006
ACM
Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a ...
PODS
2006
ACM
14 years 7 months ago
2006
ACM
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
TSP
2010
13 years 2 months ago
2010
Abstract--This paper considers the problem of scalable distributed coding of correlated sources that are communicated to a central unit, a setting typically encountered in sensor n...
CVPR
2009
IEEE
14 years 12 months ago
2009
IEEE
Central to many problems in scene understanding based on using a network of tens, hundreds or even thousands of randomly distributed cameras with on-board processing and wireless c...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...