70 search results - page 9 / 14 » Fast computation of low rank matrix |
ICPR
2002
IEEE
14 years 9 months ago
2002
IEEE
We present a fast non-iterative method for approximating the leading eigenvector so as to render graph-spectral based grouping algorithms more efficient. The approximation is base...
SLSFS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Matrix factorization is a fundamental building block in many computer vision and machine learning algorithms. In this work we focus on the problem of ”structure from mo...
KDD
2012
ACM
11 years 11 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...
SIAMNUM
2011
12 years 11 months ago
2011
Abstract. When studying the ε-pseudospectrum of a matrix, one is often interested in computing the extremal points having maximum real part or modulus. This is a crucial step, for...
TKDE
2008
13 years 8 months ago
2008
Abstract-- In peer-to-peer (P2P) networks, reputation aggregation and peer ranking are the most time-consuming and spacedemanding operations. This paper proposes a gossip-based rep...