38 search results - page 2 / 8 » Rescheduling for Locality in Sparse Matrix Computations |
ECCV
2008
Springer
14 years 6 months ago
2008
Springer
We present a new Gaussian Process inference algorithm, called Online Sparse Matrix Gaussian Processes (OSMGP), and demonstrate its merits with a few vision applications. The OSMGP ...
HPCN
1997
Springer
13 years 8 months ago
1997
Springer
For regular, sparse, linear systems, like those derived from regular grids, using High Performance Fortran (HPF) for iterative solvers is straightforward. However, for irregular ma...
FPGA
2005
ACM
13 years 10 months ago
2005
ACM
Floating-point Sparse Matrix-Vector Multiplication (SpMXV) is a key computational kernel in scientific and engineering applications. The poor data locality of sparse matrices sig...
ECCV
2008
Springer
13 years 5 months ago
2008
Springer
—This paper presents a fast part-based subspace selection algorithm, termed the binary sparse nonnegative matrix factorization (B-SNMF). Both the training process and the testing...
FPGA
2005
ACM
13 years 10 months ago
2005
ACM
Large, high density FPGAs with high local distributed memory bandwidth surpass the peak floating-point performance of high-end, general-purpose processors. Microprocessors do not...