64 search results - page 6 / 13 » Sparse Matrix Multiplication Using UPC |
SAMOS
2010
Springer
13 years 6 months ago
2010
Springer
—Previous vector architectures divided the available register file space in a fixed number of registers of equal sizes and shapes. We propose a register file organization whic...
EUROPAR
2003
Springer
14 years 23 days ago
2003
Springer
Abstract. This paper shows how a sparse hypermatrix Cholesky factorization can be improved. This is accomplished by means of efficient codes which operate on very small dense matri...
ICA
2007
Springer
14 years 1 months ago
2007
Springer
Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can b...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
We consider the problem of finding a few representatives for a dataset, i.e., a subset of data points that efficiently describes the entire dataset. We assume that each data poi...
PC
2002
13 years 7 months ago
2002
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...