358 search results - page 5 / 72 » Rank Matrix Factorisation |
EWCBR
2008
Springer
14 years 19 days ago
2008
Springer
After fifteen years of CBR conferences, this paper sets out to examine the themes that have evolved in CBR research as revealed by the implicit and explicit relationships between t...
ICML
2007
IEEE
14 years 11 months ago
2007
IEEE
We generalize the Winnow algorithm for learning disjunctions to learning subspaces of low rank. Subspaces are represented by symmetric projection matrices. The online algorithm ma...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
A completion of an m-by-n matrix A with entries in {0,1,} is obtained by setting all -entries to
CORR
2007
Springer
13 years 11 months ago
2007
Springer
A bimatrix game (A, B) is called a game of rank k if the rank of the matrix A + B is at most k. We consider the problem of enumerating the Nash equilibria in
SIAMCOMP
2010
13 years 5 months ago
2010
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...