Sciweavers

9 search results - page 2 / 2
» The Mortality Problem for Matrices of Low Dimensions
Sort
View
TNN
2010
148views Management» more  TNN 2010»
13 years 1 months ago
Generalized low-rank approximations of matrices revisited
Compared to Singular Value Decomposition (SVD), Generalized Low Rank Approximations of Matrices (GLRAM) can consume less computation time, obtain higher compression ratio, and yiel...
Jun Liu, Songcan Chen, Zhi-Hua Zhou, Xiaoyang Tan
MP
2011
13 years 1 months ago
Null space conditions and thresholds for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
SIAMJO
2010
100views more  SIAMJO 2010»
13 years 1 months ago
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
Nathan Krislock, Henry Wolkowicz
CVPR
2008
IEEE
14 years 8 months ago
Dimensionality reduction using covariance operator inverse regression
We consider the task of dimensionality reduction for regression (DRR) whose goal is to find a low dimensional representation of input covariates, while preserving the statistical ...
Minyoung Kim, Vladimir Pavlovic