796 search results - page 16 / 160 » Approximating the centroid is hard |
WILF
2009
Springer
14 years 6 months ago
2009
Springer
This paper presents a novel method aimed to free form deformation
function approximation for purpose of image registration. The
method is currently feature-based. The algorithm i...
ACL
2010
13 years 5 months ago
2010
We consider the search for a maximum likelihood assignment of hidden derivations and grammar weights for a probabilistic context-free grammar, the problem approximately solved by ...
COCO
2006
Springer
13 years 11 months ago
2006
Springer
We provide the first hardness result for the Covering Radius Problem on lattices (CRP). Namely, we show that for any large enough p there exists a constant cp > 1 such that C...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We survey results on the hardness of approximating combinatorial optimization problems. Contents
COCO
2005
Springer
14 years 1 months ago
2005
Springer
We study the complexity of approximating Max NME3SAT, a variant of Max 3SAT when the instances are guaranteed to not have any mixed clauses, i.e., every clause has either all its ...