Sciweavers

8 search results - page 1 / 2
» gsn 2009
Sort
View
FOCS
2009
IEEE
13 years 11 months ago
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
Zeev Nutov
GSN
2009
Springer
149views Sensor Networks» more  GSN 2009»
13 years 9 months ago
Spatially-Localized Compressed Sensing and Routing in Multi-hop Sensor Networks
We propose energy-efficient compressed sensing for wireless sensor networks using spatially-localized sparse projections. To keep the transmission cost for each measurement low, we...
Sungwon Lee, Sundeep Pattem, Maheswaran Sathiamoor...
GSN
2009
Springer
140views Sensor Networks» more  GSN 2009»
13 years 9 months ago
Estimation of Pollutant-Emitting Point-Sources Using Resource-Constrained Sensor Networks
We present an algorithm that makes an appropriate use of a Kalman filter combined with a geometric computation with respect to the localisation of a pollutant-emitting point sourc...
Michael Zoumboulakis, George Roussos
GSN
2009
Springer
137views Sensor Networks» more  GSN 2009»
13 years 9 months ago
A Stimulus-Centric Algebraic Approach to Sensors and Observations
The understanding of complex environmental phenomena, such as deforestation and epidemics, requires observations at multiple scales. This scale dependency is not handled well by to...
Christoph Stasch, Krzysztof Janowicz, Arne Brö...
GSN
2009
Springer
155views Sensor Networks» more  GSN 2009»
13 years 8 months ago
Distributed Network Configuration for Wavelet-Based Compression in Sensor Networks
En-route data compression is fundamental to reduce the power consumed for data gathering in sensor networks. Typical in-network compression schemes involve the distributed computat...
Paula Tarrío, Giuseppe Valenzise, Godwin Sh...