394 search results - page 32 / 79 » Expected Case for Projecting Points |
178
click to vote
ECCV
2002
Springer
16 years 7 months ago
2002
Springer
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
128
Voted
PR
2007
15 years 5 months ago
2007
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
142
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
159
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
162
click to vote
ROBOCUP
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. The SocRob project was born as a challenge for multidisciplinary research on broad and generic approaches for the design of a cooperative robot society, involving Control...