337 search results - page 7 / 68 » Semidefinite Programming Based Approximation Algorithms |
SIAMJO
2002
13 years 7 months ago
2002
In this paper we propose a novel finite-horizon, discrete-time, time-varying filtering method based on the robust semidefinite programming (SDP) technique. The proposed method prov...
SIAMJO
2008
13 years 7 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 7 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 ...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
For every fixed 0, we give an algorithm that, given an n-vertex 3-uniform hypergraph containing an independent set of size n, finds an independent set of size n(2 ) . This improv...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
Structural alignments are the most widely used tools for comparing proteins with low sequence similarity. The main contribution of this paper is to derive various kernels on prote...