Sciweavers

1274 search results - page 153 / 255
» The Geometry of Coin-Weighing Problems
Sort
View
COCOA
2008
Springer
15 years 8 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth
COMPGEOM
2008
ACM
15 years 8 months ago
Embedding and similarity search for point sets under translation
Pattern matching in point sets is a well studied problem with numerous applications. We assume that the point sets may contain outliers (missing or spurious points) and are subjec...
Minkyoung Cho, David M. Mount
STACS
1999
Springer
15 years 10 months ago
An Optimal Competitive Strategy for Walking in Streets
We present an optimal strategy for searching for a goal in a street which achieves the competitive factor of √ 2, thus matching the best lower bound known before. This finally ...
Christian Icking, Rolf Klein, Elmar Langetepe
ICALP
1992
Springer
15 years 10 months ago
On Nearest-Neighbor Graphs
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
Mike Paterson, F. Frances Yao
CDC
2009
IEEE
148views Control Systems» more  CDC 2009»
15 years 10 months ago
An adaptive artificial potential function approach for geometric sensing
In this paper, a novel artificial potential function is proposed for planning the path of a robotic sensor in a partially observed environment containing multiple obstacles and mul...
Guoxian Zhang, Silvia Ferrari