1261 search results - page 82 / 253 » Approximation algorithms for aligning points |
PSIVT
2007
Springer
15 years 3 months ago
2007
Springer
It is often practical to measure how linear a certain ordered set of points is. We are interested in linearity measures which are invariant to rotation, scaling, and translation. T...
106
click to vote
SIAMCOMP
2008
14 years 9 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...
ESWS
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we describe a web-based tool that supports the human in revising ontology alignments. Our tool uses logical reasoning as a basis for detecting conflicts in mappings ...
EOR
2010
14 years 10 months ago
2010
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
CGI
2004
IEEE
15 years 1 months ago
2004
IEEE
This paper presents a powerful variant of the ICP (Iterative Closest Point) algorithm for registering range images using a probability field. The probability field (p-field) repre...