Sciweavers

38 search results - page 1 / 8
» Rescheduling for Locality in Sparse Matrix Computations
Sort
View
ICCS
2001
Springer
13 years 8 months ago
Rescheduling for Locality in Sparse Matrix Computations
Michelle Mills Strout, Larry Carter, Jeanne Ferran...
CF
2005
ACM
13 years 5 months ago
Sparse matrix storage revisited
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...
Malik Silva
CVPR
2012
IEEE
11 years 6 months ago
Non-negative low rank and sparse graph for semi-supervised learning
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...
Liansheng Zhuang, Haoyuan Gao, Zhouchen Lin, Yi Ma...
CVPR
2010
IEEE
13 years 8 months ago
Local Features Are Not Lonely - Laplacian Sparse Coding for Image Classification
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...
Shenghua Gao, Wai-Hung Tsang, Liang-Tien Chia, Pei...
ISHPC
1997
Springer
13 years 7 months ago
Implementing Iterative Solvers for Irregular Sparse Matrix Problems in High Performance Fortran
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...
Eric de Sturler, Damian Loher