Sciweavers

1068 search results - page 22 / 214
» Factorization as a Rank 1 Problem
Sort
View
ISCAS
2008
IEEE
217views Hardware» more  ISCAS 2008»
15 years 4 months ago
Approximate L0 constrained non-negative matrix and tensor factorization
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
Morten Mørup, Kristoffer Hougaard Madsen, L...
TIT
2010
103views Education» more  TIT 2010»
14 years 4 months ago
Codes in permutations and error correction for rank modulation
Codes for rank modulation have been recently proposed as a means of protecting flash memory devices from errors. We study basic coding theoretic problems for such codes, representi...
Alexander Barg, Arya Mazumdar
CSR
2007
Springer
15 years 3 months ago
On the Complexity of Matrix Rank and Rigidity
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, in order to obtain completeness results for small complexity classes. In partic...
Meena Mahajan, Jayalal M. N. Sarma
ICASSP
2011
IEEE
14 years 1 months ago
Low-rank matrix completion by variational sparse Bayesian learning
There has been a significant interest in the recovery of low-rank matrices from an incomplete of measurements, due to both theoretical and practical developments demonstrating th...
S. Derin Babacan, Martin Luessi, Rafael Molina, Ag...
AMFG
2003
IEEE
126views Biometrics» more  AMFG 2003»
15 years 3 months ago
Rank Constrained Recognition under Unknown Illuminations
Recognition under illumination variations is a challenging problem. The key is to successfully separate the illumination source from the observed appearance. Once separated, what ...
Shaohua Kevin Zhou, Rama Chellappa