131 search results - page 3 / 27 » Optimization techniques for small matrix multiplication |
ICCS
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
ICPP
2009
IEEE
14 years 3 days ago
2009
IEEE
—Sparse Matrix-Vector multiplication (SpMV) is a very challenging computational kernel, since its performance depends greatly on both the input matrix and the underlying architec...
MFCS
2010
Springer
13 years 3 months ago
2010
Springer
We consider evaluating one bilinear form defined by a sparse Ny × Nx matrix A having h entries on w pairs of vectors The model of computation is the semiring I/O-model with main ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Recent work has demonstrated that using a carefully designed sensing matrix rather than a random one, can improve the performance of compressed sensing. In particular, a welldesign...
ICCS
2009
Springer
14 years 14 hour ago
2009
Springer
The development of optimized codes is time-consuming and requires extensive architecture, compiler, and language expertise, therefore, computational scientists are often forced to ...