205 search results - page 1 / 41 » On Approximation Algorithms for Hierarchical MAX-SAT |
176
Voted
CP
2009
Springer
15 years 11 months ago
2009
Springer
We introduce a new approach to approximating weighted Max-SAT problems that is based on simplifying a given instance, and then tightening the approximation. First, we relax its str...
WAOA
2005
Springer
15 years 4 months ago
2005
Springer
MAX SAT and MAX NAE-SAT are central problems in theoretical computer science. We present an approximation algorithm for MAX NAE-SAT with a conjectured performance guarantee of 0.82...
STOC
2003
ACM
15 years 11 months ago
2003
ACM
90
Voted
IJCV
2012
13 years 1 months ago
2012
Abstract Computer vision is full of problems elegantly expressed in terms of energy minimization. We characterize a class of energies with hierarchical costs and propose a novel hi...
156
Voted
SMI
2010
IEEE
14 years 9 months ago
2010
IEEE
We present a method to compute the medial axis of a smooth curve or surface by using PHT-spline (polynomial splines over hierarchical T-meshes) hierarchical approximation. In part...