1261 search results - page 89 / 253 » Approximation algorithms for aligning points |
AAECC
1995
Springer
15 years 1 months ago
1995
Springer
In [ASTW] it was given a Grobner reduction based division formula for entire functions by polynomial ideals. Here we give degree bounds where the input function can be truncated i...
103
click to vote
ALGORITHMICA
2006
14 years 10 months ago
2006
Dai, Li, and Wu proposed Rule k, a localized approximation algorithm that attempts to find a small connected dominating set in a graph. In this paper we consider the "average...
GECCO
2010
Springer
14 years 11 months ago
2010
Springer
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
COMPGEOM
1998
ACM
15 years 2 months ago
1998
ACM
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
183
click to vote
ICDE
2000
IEEE
15 years 11 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...