1261 search results - page 126 / 253 » Approximation algorithms for aligning points |
226
click to vote
COMPGEOM
2011
ACM
14 years 6 months ago
2011
ACM
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
138
click to vote
GRAPHITE
2005
ACM
15 years 8 months ago
2005
ACM
Surface fitting refers to the process of constructing a smooth representation for an object surface from a fairly large number of measured 3D data points. This paper presents an ...
132
click to vote
ESA
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
166
click to vote
FOGA
2011
14 years 6 months ago
2011
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...
146
click to vote
SODA
2010
ACM
15 years 21 days ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...