1261 search results - page 150 / 253 » Approximation algorithms for aligning points |
206
click to vote
ESA
1995
Springer
15 years 10 months ago
1995
Springer
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
158
click to vote
COMPGEOM
2006
ACM
16 years 20 days ago
2006
ACM
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...
148
click to vote
SIAMJO
2010
15 years 1 months ago
2010
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
141
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
The standard approach for learning Markov Models with Hidden State uses the Expectation-Maximization framework. While this approach had a significant impact on several practical ap...
174
click to vote
SCA
2007
15 years 9 months ago
2007
We propose a method to automatically transform mesh animations into animation collages, i.e. moving assemblies of shape primitives from a database given by an artist. An animation...