Sciweavers

661 search results - page 76 / 133
» Local Approximation Algorithms for Scheduling Problems in Se...
Sort
View
RTCSA
2007
IEEE
14 years 3 months ago
A Dynamic Medial Axis Model for Sensor Networks
An important property in a sensor network is the monitoring of temporal changes of hazardous situations such as forest fires. Rescue groups need to be aware of dynamic changes th...
Lan Lin, Hyunyoung Lee
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
14 years 14 days ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
Rajiv Gandhi, Julián Mestre
CORR
2010
Springer
107views Education» more  CORR 2010»
13 years 7 months ago
Distributed Detection over Time Varying Networks: Large Deviations Analysis
—We apply large deviations theory to study asymptotic performance of running consensus distributed detection in sensor networks. Running consensus is a stochastic approximation t...
Dragana Bajovic, Dusan Jakovetic, João Xavi...
ICDE
2006
IEEE
163views Database» more  ICDE 2006»
14 years 10 months ago
A Sampling-Based Approach to Optimizing Top-k Queries in Sensor Networks
Wireless sensor networks generate a vast amount of data. This data, however, must be sparingly extracted to conserve energy, usually the most precious resource in battery-powered ...
Adam Silberstein, Carla Schlatter Ellis, Jun Yang ...
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
14 years 2 months ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky