1261 search results - page 124 / 253 » Approximation algorithms for aligning points |
107
click to vote
VLDB
2004
ACM
15 years 3 months ago
2004
ACM
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
SMI
2006
IEEE
15 years 4 months ago
2006
IEEE
We present an algorithm for finding a meaningful vertexto-vertex correspondence between two 3D shapes given as triangle meshes. Our algorithm operates on embeddings of the two sh...
APPROX
2004
Springer
15 years 3 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
CCCG
2001
14 years 11 months ago
2001
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
ICTAI
2007
IEEE
15 years 4 months ago
2007
IEEE
The ability of an algorithm to accurately estimate the parameters of the geometric transformation which aligns two image profiles even in the presence of photometric distortions ...