213 search results - page 29 / 43 » Semidefinite programming |
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
Maximum Margin Matrix Factorization (MMMF) was recently suggested (Srebro et al., 2005) as a convex, infinite dimensional alternative to low-rank approximations and standard facto...
STOC
2004
ACM
16 years 20 days ago
2004
ACM
The cut-norm ||A||C of a real matrix A = (aij)iR,jS is the maximum, over all I R, J S of the quantity | iI,jJ aij|. This concept plays a major role in the design of efficient app...
109
click to vote
ICNSC
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, a variance constrained filtering problem is considered for systems with both non-Gaussian noises and polytopic uncertainty. A novel filter is developed to estimate t...
117
click to vote
APPROX
2008
Springer
15 years 2 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...
100
click to vote
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we investigate whether a constant round Lasserre Semi-definite Programming (SDP) relaxation might give a good approximation to the UNIQUE GAMES problem. We show tha...