Sciweavers

205 search results - page 1 / 41
» On Approximation Algorithms for Hierarchical MAX-SAT
Sort
View
171
Voted
CP
2009
Springer
15 years 10 months ago
Approximating Weighted Max-SAT Problems by Compensating for Relaxations
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...
Arthur Choi, Trevor Standley, Adnan Darwiche
WAOA
2005
Springer
163views Algorithms» more  WAOA 2005»
15 years 3 months ago
Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT
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...
Adi Avidor, Ido Berkovitch, Uri Zwick
86
Voted
IJCV
2012
13 years 17 days ago
Minimizing Energies with Hierarchical Costs
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...
Andrew Delong, Lena Gorelick, Olga Veksler, Yuri B...
151
Voted
SMI
2010
IEEE
228views Image Analysis» more  SMI 2010»
14 years 8 months ago
Hierarchical Spline Approximation of the Signed Distance Function
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...
Xinghua Song, Bert Jüttler, Adrien Poteaux