1261 search results - page 23 / 253 » Approximation algorithms for aligning points |
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
VC
2008
14 years 9 months ago
2008
Abstract We propose a new featurebased registration method for rigidbody alignment of overlapping point clouds (PCs) efficiently under the influence of noise and outliers. The prop...
122
click to vote
IPCO
2001
14 years 11 months ago
2001
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
118
click to vote
ICDT
2011
ACM
14 years 1 months ago
2011
ACM
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not do...
BMCBI
2010
14 years 9 months ago
2010
Background: An algorithm is presented to compute a multiple structure alignment for a set of proteins and to generate a consensus (pseudo) protein which captures common substructu...