Sciweavers

242 search results - page 6 / 49
» Approximately uniform random sampling in sensor networks
Sort
View
MDM
2007
Springer
131views Communications» more  MDM 2007»
14 years 1 months ago
Q-NiGHT: Adding QoS to Data Centric Storage in Non-Uniform Sensor Networks
Storage of sensed data in wireless sensor networks is essential when the sink node is unavailable due to failure and/or disconnections, but it can also provide efficient access t...
Michele Albano, Stefano Chessa, Francesco Nidito, ...
TSP
2008
101views more  TSP 2008»
13 years 7 months ago
Optimal Node Density for Detection in Energy-Constrained Random Networks
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
Animashree Anandkumar, Lang Tong, Ananthram Swami
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
13 years 8 months ago
Approximating connected facility location problems via random facility sampling and core detouring
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...
WWW
2011
ACM
13 years 2 months ago
Network bucket testing
Bucket testing, also known as A/B testing, is a practice that is widely used by on-line sites with large audiences: in a simple version of the methodology, one evaluates a new fea...
Lars Backstrom, Jon M. Kleinberg
SENSYS
2003
ACM
14 years 19 days ago
SIA: secure information aggregation in sensor networks
Sensor networks promise viable solutions to many monitoring problems. However, the practical deployment of sensor networks faces many challenges imposed by real-world demands. Sen...
Bartosz Przydatek, Dawn Xiaodong Song, Adrian Perr...