201 search results - page 4 / 41 » Memory Optimizations For Fast Power-Aware Sparse Computation... |
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
Several methods have been proposed in the literature for the distribution of data on distributed memory machines, either oriented to dense or sparse structures. Many of the real a...
HPCC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We improve the performance of sparse matrix-vector multiplication (SpMV) on modern cache-based superscalar machines when the matrix structure consists of multiple, irregu...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of t...
SIAMSC
2011
12 years 10 months ago
2011
Abstract. An efficient parallel algorithm is presented and tested for computing selected components of H−1 where H has the structure of a Hamiltonian matrix of two-dimensional la...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...