562 search results - page 32 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
FSTTCS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
ICRA
2003
IEEE
15 years 3 months ago
2003
IEEE
The decades of research in motion planning have resulted in numerous algorithms. Many of the most successful algorithms are randomized and can have widely differing run-times for ...
DAGM
2004
Springer
15 years 3 months ago
2004
Springer
We consider the general problem of learning from labeled and unlabeled data. Given a set of points, some of them are labeled, and the remaining points are unlabeled. The goal is to...
ALGORITHMICA
1998
14 years 9 months ago
1998
This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data stru...
102
click to vote
JGAA
2007
14 years 9 months ago
2007
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...