90 search results - page 9 / 18 » On approximating complex quadratic optimization problems via... |
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
SIAMJO
2008
13 years 8 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
ESWS
2011
Springer
12 years 11 months ago
2011
Springer
The emergence of the Semantic Web has led to the creation of large semantic knowledge bases, often in the form of RDF databases. Improving the performance of RDF databases necessit...
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
Many structured prediction tasks involve complex models where inference is computationally intractable, but where it can be well approximated using a linear programming relaxation...