Sciweavers

157 search results - page 6 / 32
» Randomized Algorithms for Minimum Distance Localization
Sort
View
TSP
2008
106views more  TSP 2008»
13 years 7 months ago
Guaranteeing Practical Convergence in Algorithms for Sensor and Source Localization
This paper considers localization of a source or a sensor from distance measurements. We argue that linear algorithms proposed for this purpose are susceptible to poor noise perfor...
Baris Fidan, Soura Dasgupta, Brian D. O. Anderson
IPSN
2005
Springer
14 years 1 months ago
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu
FOCS
2008
IEEE
14 years 2 months ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak
ICASSP
2010
IEEE
13 years 8 months ago
Bridge detection and robust geodesics estimation via random walks
We propose an algorithm for detecting bridges and estimating geodesic distances from a set of noisy samples of an underlying manifold. Finding geodesics on a nearest neighbors gra...
Eugene Brevdo, Peter J. Ramadge
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
13 years 6 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer