358 search results - page 31 / 72 » Rank Matrix Factorisation |
91
Voted
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...
130
click to vote
KDD
2012
ACM
13 years 2 months ago
2012
ACM
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
125
click to vote
ICC
2011
IEEE
14 years 2 days ago
2011
IEEE
— This paper focuses on controlling absorbing sets for a class of regular LDPC codes, known as separable, circulantbased (SCB) codes. For a specified circulant matrix, SCB codes...
101
Voted
IVCNZ
1998
15 years 1 months ago
1998
We address the problem of estimating a fundamental matrix from a given set of corresponding pixels in two perspective images of a 3D scene that form a stereopair. The 3x3 fundamen...
101
Voted
SIAMSC
2008
15 years 11 days ago
2008
In this study, nonnegative matrix factorization is recast as the problem of approximating a polytope on the probability simplex by another polytope with fewer facets. Working on th...