77 search results - page 10 / 16 » Exact Matrix Completion via Convex Optimization |
ICASSP
2009
IEEE
14 years 3 months ago
2009
IEEE
We propose a convex optimization method for maximum likelihood estimation of autoregressive models, subject to conditional independence constraints. This problem is an extension t...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
EMO
2006
Springer
14 years 8 days ago
2006
Springer
The design of quality measures for approximations of the Pareto-optimal set is of high importance not only for the performance assessment, but also for the construction of multiobj...
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...
SIAMJO
2011
13 years 3 months ago
2011
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...