236 search results - page 9 / 48 » Fast Sparse Matrix Multiplication |
CISS
2008
IEEE
14 years 1 months ago
2008
IEEE
—Thus far, sparse representations have been exploited largely in the context of robustly estimating functions in a noisy environment from a few measurements. In this context, the...
TPDS
2002
13 years 7 months ago
2002
The performance of both serial and parallel implementations of matrix multiplication is highly sensitive to memory system behavior. False sharing and cache conflicts cause traditi...
SIAMSC
2008
13 years 7 months ago
2008
Abstract. Many vector-valued functions, representing expensive computations, are also structured computations. In this case the calculation of the Newton step can be greatly accele...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
Abstract. Non-negative sparse coding is a method for decomposing multivariate data into non-negative sparse components. In this paper we briefly describe the motivation behind this...