Sciweavers

358 search results - page 7 / 72
» Rank Matrix Factorisation
Sort
View
AMDO
2004
Springer
15 years 2 months ago
On-the-Fly Training
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 ...
Javier Melenchón, Lourdes Meler, Ignasi Iri...
MICS
2007
128views more  MICS 2007»
14 years 10 months ago
Structured Low Rank Approximation of a Bezout Matrix
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...
Dongxia Sun, Lihong Zhi
MOR
2008
110views more  MOR 2008»
14 years 10 months ago
On the Low Rank Solutions for Linear Matrix Inequalities
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...
Wenbao Ai, Yongwei Huang, Shuzhong Zhang
ICASSP
2011
IEEE
14 years 2 months ago
SRF: Matrix completion based on smoothed rank function
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...
Hooshang Ghasemi, Mohmmadreza Malek-Mohammadi, Mas...
JCT
2008
96views more  JCT 2008»
14 years 10 months ago
Graphs with full rank 3-color matrix and few 3-colorings
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...
Serguei Norine, Jean-Sébastien Sereni