167 search results - page 14 / 34 » Constraints for closest point finding |
SIAMCOMP
2008
13 years 7 months ago
2008
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
CVPR
1997
IEEE
14 years 5 days ago
1997
IEEE
ÐWe describe a new direct method for estimating structure and motion from image intensities of multiple views. We extend the direct methods of Horn and Weldon [18] to three views....
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
Suppose that two perspective views of four world points are given, that the intrinsic parameters are known, but the camera poses and the world point positions are not. We prove tha...
COLT
1999
Springer
14 years 7 days ago
1999
Springer
We consider the AdaBoost procedure for boosting weak learners. In AdaBoost, a key step is choosing a new distribution on the training examples based on the old distribution and th...
SSD
2007
Springer
14 years 2 months ago
2007
Springer
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...