1272 search results - page 93 / 255 » Approximate Parameterized Matching |
154
click to vote
SMI
2006
IEEE
15 years 9 months ago
2006
IEEE
Surface matching is a common task in computer graphics and computer vision. In this paper, we introduce a novel algorithm that aligns scanned point-based surfaces to the related 3...
143
Voted
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest i...
146
click to vote
COMPGEOM
2000
ACM
15 years 7 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
126
Voted
ALGORITHMICA
1999
15 years 3 months ago
1999
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
137
Voted
IPL
2002
15 years 3 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...