1082 search results - page 113 / 217 » Approximation Algorithms for Spreading Points |
110
Voted
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
118
click to vote
CVGIP
2007
15 years 2 months ago
2007
This paper presents a technique for creating a smooth, closed surface from a set of 2D contours, which have been extracted from a 3D scan. The technique interprets the pixels that...
133
Voted
STACS
2005
Springer
15 years 8 months ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
126
Voted
UAI
2004
15 years 4 months ago
2004
Generalized belief propagation (GBP) has proven to be a promising technique for approximate inference tasks in AI and machine learning. However, the choice of a good set of cluste...
132
Voted
SIAMJO
2008
15 years 2 months ago
2008
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...