21 search results - page 4 / 5 » Complexity of Approximating Closest Substring Problems |
140
click to vote
MOBIHOC
2010
ACM
15 years 2 months ago
2010
ACM
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
130
click to vote
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract—The high-level synthesis process allows the automatic design and implementation of digital circuits starting from a behavioral description. Evolutionary algorithms are v...
159
click to vote
ECCV
2002
Springer
16 years 6 months ago
2002
Springer
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
148
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
153
click to vote
CGF
2002
15 years 4 months ago
2002
Three-dimensional (3D) image acquisition systems are rapidly becoming more affordable, especially systems based on commodity electronic cameras. At the same time, personal compute...