Sciweavers

63 search results - page 2 / 13
» Recovery of sparse perturbations in Least Squares problems
Sort
View
ISNN
2007
Springer
13 years 11 months ago
Regularized Alternating Least Squares Algorithms for Non-negative Matrix/Tensor Factorization
Nonnegative Matrix and Tensor Factorization (NMF/NTF) and Sparse Component Analysis (SCA) have already found many potential applications, especially in multi-way Blind Source Separ...
Andrzej Cichocki, Rafal Zdunek
ICDM
2009
IEEE
172views Data Mining» more  ICDM 2009»
13 years 12 months ago
Sparse Least-Squares Methods in the Parallel Machine Learning (PML) Framework
—We describe parallel methods for solving large-scale, high-dimensional, sparse least-squares problems that arise in machine learning applications such as document classificatio...
Ramesh Natarajan, Vikas Sindhwani, Shirish Tatikon...
ICCV
2009
IEEE
14 years 10 months ago
Sparse Representation of Cast Shadows via L1-Regularized Least Squares
Scenes with cast shadows can produce complex sets of images. These images cannot be well approximated by lowdimensional linear subspaces. However, in this paper we show that the...
Xue Mei, Haibin Ling, David W. Jacobs
ICASSP
2011
IEEE
12 years 9 months ago
A hybrid compressed sensing algorithm for sparse channel estimation in MIMO OFDM systems
Due to multipath delay spread and relatively high sampling rate in OFDM systems, the channel estimation is formulated as a sparse recovery problem, where a hybrid compressed sensi...
Chenhao Qi, Lenan Wu
TCS
2008
13 years 5 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi