Sciweavers

77 search results - page 7 / 16
» Exact Matrix Completion via Convex Optimization
Sort
View
INFOCOM
2000
IEEE
14 years 1 months ago
Optimal Partition of QoS requirements with Discrete Cost Functions
Abstract—The future Internet is expected to support applications with quality of service (QoS) requirements. For this end several mechanisms are suggested in the IETF to support ...
Danny Raz, Yuval Shavitt
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 7 months ago
Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements
This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entr...
Emmanuel J. Candès, Yaniv Plan
AUTOMATICA
2002
81views more  AUTOMATICA 2002»
13 years 8 months ago
A convex approach to the characterization of the frequency response of ellipsoidal plants
This paper deals with the frequency domain properties of an ellipsoidal family of rational functions, i.e. a family of rational functions whose coefficients depend affinely on an ...
Graziano Chesi, Andrea Garulli, Alberto Tesi, Anto...
FOCM
2011
175views more  FOCM 2011»
13 years 3 months ago
Convergence of Fixed-Point Continuation Algorithms for Matrix Rank Minimization
The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding etc. As this problem is NP-hard in ...
Donald Goldfarb, Shiqian Ma
CVPR
2011
IEEE
13 years 4 months ago
Accelerated Low-Rank Visual Recovery by Random Projection
Exact recovery from contaminated visual data plays an important role in various tasks. By assuming the observed data matrix as the addition of a low-rank matrix and a sparse matri...
Yadong Mu, Jian Dong, Xiaotong Yuan, Shuicheng Yan