8669 search results - page 113 / 1734 » Computing matrix representations |
CIKM
2010
Springer
13 years 7 months ago
2010
Springer
In Latent Semantic Indexing (LSI), a collection of documents is often pre-processed to form a sparse term-document matrix, followed by a computation of a low-rank approximation to...
PARA
2004
Springer
14 years 2 months ago
2004
Springer
During the last half-decade, a number of research efforts have centered around developing software for generating automatically tuned matrix multiplication kernels. These include ...
CCECE
2006
IEEE
14 years 25 days ago
2006
IEEE
This paper presents a forgetting factor scheme for variable step-size affine projection algorithms (APA). The proposed scheme uses a forgetting processed input matrix as the projec...
ICPR
2000
IEEE
14 years 1 months ago
2000
IEEE
All the methods for estimating the fundamental matrix do not naturally exploit the rank-2 constraint. For these reason some few rank-2 parameterizations of the fundamental matrix ...
JMLR
2010
13 years 3 months ago
2010
This paper considers the problem of estimating a high dimensional inverse covariance matrix that can be well approximated by "sparse" matrices. Taking advantage of the c...