49 search results - page 3 / 10 » Localization: Approximation and Performance Bounds to Minimi... |
SIGMETRICS
2010
ACM
13 years 10 months ago
2010
ACM
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
WADS
2005
Springer
13 years 11 months ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
ALGOSENSORS
2008
Springer
13 years 7 months ago
2008
Springer
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
CEC
2010
IEEE
12 years 9 months ago
2010
IEEE
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...