Sciweavers

157 search results - page 7 / 32
» Randomized Algorithms for Minimum Distance Localization
Sort
View
ICC
2009
IEEE
142views Communications» more  ICC 2009»
14 years 2 months ago
Localized Sensor Self-Deployment for Guaranteed Coverage Radius Maximization
—Focused coverage is defined as the coverage of a wireless sensor network surrounding a point of interest (POI), and is measured by coverage radius, i.e., minimum distance from ...
Xu Li, Hannes Frey, Nicola Santoro, Ivan Stojmenov...
WOWMOM
2005
ACM
115views Multimedia» more  WOWMOM 2005»
14 years 1 months ago
Precise Distributed Localization Algorithms for Wireless Networks
We propose in this paper reliable and precise distributed localization algorithms for wireless networks: iterative multidimensional scaling (IT-MDS) and simulated annealing multid...
Saad Biaz, Yiming Ji
STOC
2004
ACM
142views Algorithms» more  STOC 2004»
14 years 8 months ago
Lower bounds for local search by quantum arguments
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hype...
Scott Aaronson
ICRA
2007
IEEE
127views Robotics» more  ICRA 2007»
14 years 2 months ago
Determining the Robot-to-Robot Relative Pose Using Range-only Measurements
Abstract— In this paper we address the problem of determining the relative pose of pairs robots that move on a plane while measuring the distance to each other. We show that the ...
Xun S. Zhou, Stergios I. Roumeliotis
ICALP
2001
Springer
14 years 12 days ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan