Sciweavers

77 search results - page 11 / 16
» Exact Matrix Completion via Convex Optimization
Sort
View
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
13 years 8 months ago
Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
TWC
2008
131views more  TWC 2008»
13 years 8 months ago
On channel estimation and optimal training design for amplify and forward relay networks
In this paper, we provide a complete study on the training based channel estimation issues for relay networks that employ the amplify-and-forward (AF) transmission scheme. We first...
Feifei Gao, Tao Cui, Arumugam Nallanathan
PROCEDIA
2010
344views more  PROCEDIA 2010»
13 years 7 months ago
Towards high-quality, untangled meshes via a force-directed graph embedding approach
High quality meshes are crucial for the solution of partial differential equations (PDEs) via the finite element method (or other PDE solvers). The accuracy of the PDE solution,...
Sanjukta Bhowmick, Suzanne M. Shontz
SIAMMAX
2010
104views more  SIAMMAX 2010»
13 years 3 months ago
The Legendre-Fenchel Conjugate of the Product of Two Positive Definite Quadratic Forms
It is well-known that the Legendre-Fenchel conjugate of a positive definite quadratic form can be explicitly expressed as another positive definite quadratic form, and that the con...
Yun-Bin Zhao
JACM
2011
152views more  JACM 2011»
12 years 11 months ago
Robust principal component analysis?
This paper is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component i...
Emmanuel J. Candès, Xiaodong Li, Yi Ma, Joh...