Sciweavers

370 search results - page 34 / 74
» Improved Approximation Algorithms for Connected Sensor Cover
Sort
View
SIGMOD
2011
ACM
206views Database» more  SIGMOD 2011»
14 years 19 days ago
Sampling based algorithms for quantile computation in sensor networks
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
Zengfeng Huang, Lu Wang, Ke Yi, Yunhao Liu
FOCS
2007
IEEE
15 years 4 months ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
TWC
2008
80views more  TWC 2008»
14 years 9 months ago
Robust connectivity-aware energy-efficient routing for wireless sensor networks
In this paper, we consider a class of energy-aware routing algorithm that explicitly takes into account the connectivity of the remaining sensor network. In typical sensor network ...
Charles Pandana, K. J. Ray Liu
DMSN
2004
ACM
15 years 3 months ago
Optimization of in-network data reduction
We consider the in-network computation of approximate “big picture” summaries in bandwidth-constrained sensor networks. First we review early work on computing the Haar wavele...
Joseph M. Hellerstein, Wei Wang
FSR
2003
Springer
251views Robotics» more  FSR 2003»
15 years 3 months ago
Distributed Search and Rescue with Robot and Sensor Teams
We develop a network of distributed mobile sensor systems as a solution to the emergency response problem. The mobile sensors are inside a building and they form a connected ad-ho...
George Kantor, Sanjiv Singh, Ronald A. Peterson, D...