Sciweavers

385 search results - page 6 / 77
» Contour Approximation in Sensor Networks
Sort
View
ADHOCNOW
2004
Springer
15 years 3 months ago
Improved Approximation Algorithms for Connected Sensor Cover
Stefan Funke, Alexander Kesselman, Zvi Lotker, Mic...
DMSN
2004
ACM
15 years 3 months ago
Approximately uniform random sampling in sensor networks
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
Boulat A. Bash, John W. Byers, Jeffrey Considine
JCO
2006
153views more  JCO 2006»
14 years 9 months ago
Efficient point coverage in wireless sensor networks
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...
Jie Wang, Ning Zhong
PACT
2007
Springer
15 years 3 months ago
Orthogonal Organized Finite State Machine Application to Sensor Acquired Information
The application of the Orthogonal Organized Finite State Machine (OOFSM) to the representation of data acquired by sensor networks is proposed. The OOFSM was proposed in earlier wo...
Brian J. d'Auriol, John Kim, Sungyoung Lee, Young-...
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
15 years 11 months ago
Approximate Data Collection in Sensor Networks using Probabilistic Models
Wireless sensor networks are proving to be useful in a variety of settings. A core challenge in these networks is to minimize energy consumption. Prior database research has propo...
David Chu, Amol Deshpande, Joseph M. Hellerstein, ...