358 search results - page 7 / 72 » Rank Matrix Factorisation |
116
Voted
AMDO
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. A new algorithm for the incremental learning and non-intrusive tracking of the appearance of a previously non-seen face is presented. The computation is done in a causal ...
131
click to vote
MICS
2007
14 years 12 months ago
2007
The task of determining the approximate greatest common divisor (GCD) of more than two univariate polynomials with inexact coefficients can be formulated as computing for a given B...
94
Voted
MOR
2008
15 years 9 days ago
2008
In this paper we present a polynomial-time procedure to find a low rank solution for a system of Linear Matrix Inequalities (LMI). The existence of such a low rank solution was sh...
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
JCT
2008
15 years 10 days ago
2008
We exhibit a a counterexample to a conjecture of Thomassen stating that the number of distinct 3-colorings of every graph whose 3color matrix has full column rank is superpolynomi...