38 search results - page 1 / 8 » Rescheduling for Locality in Sparse Matrix Computations |
ICCS
2001
Springer
14 years 29 days ago
2001
Springer
CF
2005
ACM
13 years 10 months ago
2005
ACM
In this paper, we consider alternate ways of storing a sparse matrix and their effect on computational speed. They involve keeping both the indices and the non-zero elements in t...
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
Constructing a good graph to represent data structures is critical for many important machine learning tasks such as clustering and classification. This paper proposes a novel no...
CVPR
2010
IEEE
14 years 26 days ago
2010
IEEE
Sparse coding which encodes the original signal in a sparse signal space, has shown its state-of-the-art performance in the visual codebook generation and feature quantization pro...
ISHPC
1997
Springer
14 years 20 days ago
1997
Springer
Abstract. Writing e cient iterative solvers for irregular, sparse matrices in HPF is hard. The locality in the computations is unclear, and for e ciency we use storage schemes that...