1261 search results - page 28 / 253 » Approximation algorithms for aligning points |
151
click to vote
CVPR
2011
IEEE
14 years 6 months ago
2011
IEEE
An approximately Euclidean representation of the visible scene can be obtained directly from a range, or ‘time-offlight’, camera. An uncalibrated binocular system, in contras...
104
click to vote
ECCV
2006
Springer
16 years 4 months ago
2006
Springer
In this paper, we propose a two-level integrated model for accurate face shape alignment. At the low level, the shape is split into a set of line segments which serve as the nodes ...
115
click to vote
STACS
2001
Springer
15 years 7 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
STOC
2007
ACM
16 years 2 months ago
2007
ACM
We give a randomized bi-criteria algorithm for the problem of finding a k-dimensional subspace that minimizes the Lp-error for given points, i.e., p-th root of the sum of p-th
107
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...