1261 search results - page 191 / 253 » Approximation algorithms for aligning points |
CP
2005
Springer
15 years 3 months ago
2005
Springer
Classical methods for solving numerical CSPs are based on a branch and prune algorithm, a dichotomic enumeration process interleaved with a consistency filtering algorithm. In man...
RSCTC
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
EWC
2010
14 years 8 months ago
2010
Abstract This paper introduces a three-dimensional mesh generation algorithm for domains whose boundaries are curved surfaces, possibly with sharp features. The algorithm combines ...
ICDE
2010
IEEE
15 years 4 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
KDD
2006
ACM
15 years 10 months ago
2006
ACM
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...