279 search results - page 50 / 56 » Randomized k-Coverage Algorithms For Dense Sensor Networks |
124
click to vote
CP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
131
click to vote
PODC
2006
ACM
15 years 8 months ago
2006
ACM
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...
141
Voted
SSDBM
2007
IEEE
15 years 8 months ago
2007
IEEE
Reservoir sampling is a well-known technique for sequential random sampling over data streams. Conventional reservoir sampling assumes a fixed-size reservoir. There are situation...
123
click to vote
PODC
2005
ACM
15 years 8 months ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
109
click to vote
MOBICOM
2009
ACM
15 years 8 months ago
2009
ACM
In this paper we investigate the connectivity for large-scale clustered wireless sensor and ad hoc networks. We study the effect of mobility on the critical transmission range fo...