Sciweavers

JSAT
2008
79views more  JSAT 2008»
14 years 8 months ago
An Extended Semidefinite Relaxation for Satisfiability
This paper proposes a new semidefinite programming relaxation for the satisfiability problem. This relaxation is an extension of previous relaxations arising from the paradigm of ...
Miguel F. Anjos
CVPR
2010
IEEE
15 years 2 months ago
Polynomial Shape from Shading
We examine the shape from shading problem without boundary conditions as a polynomial system. This view allows, in generic cases, a complete solution for ideal polyhedral objects....
Ady Ecker, Allan Jepson
85
Voted
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
15 years 6 months ago
Fast SDP Algorithms for Constraint Satisfaction Problems
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
David Steurer
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
15 years 6 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau