8669 search results - page 6 / 1734 » Computing matrix representations |
CVPR
2001
IEEE
14 years 9 months ago
2001
IEEE
In this paper, we propose a novel method, called local nonnegative matrix factorization (LNMF), for learning spatially localized, parts-based subspace representation of visual pat...
FOCM
2008
13 years 7 months ago
2008
In this paper, we consider some matrix subgroups of the general linear group and in particular the special linear group that are defined by a quadratic matrix identity. The Lie al...
EUROPAR
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. We present a relational algebra based framework for compiling e cient sparse matrix code from dense DO-ANY loops and a speci cation of the representation of the sparse ma...
ICDM
2008
IEEE
14 years 2 months ago
2008
IEEE
Recently Non-negative Matrix Factorization (NMF) has received a lot of attentions in information retrieval, computer vision and pattern recognition. NMF aims to find two non-nega...
LCPC
1998
Springer
13 years 11 months ago
1998
Springer
There is a class of sparse matrix computations, such as direct solvers of systems of linear equations, that change the fill-in (nonzero entries) of the coefficient matrix, and invo...