242 search results - page 7 / 49 » Approximately uniform random sampling in sensor networks |
SSDBM
2007
IEEE
14 years 1 months ago
2007
IEEE
In stream join processing with limited memory, uniform random sampling is useful for approximate query evaluation. In this paper, we address the problem of reservoir sampling over...
RSA
2008
13 years 6 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
PODC
2004
ACM
14 years 24 days ago
2004
ACM
We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state ag...
QUESTA
2011
12 years 10 months ago
2011
: This paper studies the asymptotic behavior of the steady-state waiting time, W∞, of the M/G/1 queue with subexponenential processing times for different combinations of traffi...
IEEECIT
2010
IEEE
13 years 5 months ago
2010
IEEE
—The increasingly complex roles for which Wireless Sensor Networks (WSNs) are being employed have driven the desire for energy-efficient reliable target tracking. In this paper, ...