1261 search results - page 33 / 253 » Approximation algorithms for aligning points |
100
click to vote
ICIP
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper we propose a new approach of the two-image alignment problem based on a functional representation of images. This allows us to derive a one-to-several correspondence,...
SODA
1993
ACM
14 years 11 months ago
1993
ACM
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
CCCG
2007
14 years 11 months ago
2007
A path from a point s to a point t on the surface of a polyhedral terrain is said to be descent if for every pair of points p = (x(p), y(p), z(p)) and q = (x(q), y(q), z(q)) on th...
CCCG
1998
14 years 11 months ago
1998
Given a set P of n points in Rd, a fundamental problem in computational geometry is concerned with finding the smallest shape of some type that encloses all the points of P. Well-...
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
In reinforcement learning, least-squares temporal difference methods (e.g., LSTD and LSPI) are effective, data-efficient techniques for policy evaluation and control with linear v...