27 search results - page 2 / 6 » Distributed Sparse Matrices for Very High Level Languages |
NIPS
2004
13 years 6 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
HIPS
1998
IEEE
13 years 9 months ago
1998
IEEE
Industrial applications use specific problem-oriented implementations of large sparse and irregular data structures. Hence there is a need for tools that make it possible for deve...
PROPERTYTESTING
2010
13 years 3 months ago
2010
We study the local testability of linear codes. We first reformulate this question in the language of tolerant linearity testing under a non-uniform distribution. We then study th...
AAECC
2007
Springer
13 years 5 months ago
2007
Springer
Abstract. We present new performance models and a new, more compact data structure for cache blocking when applied to the sparse matrixvector multiply (SpM×V) operation, y ← y +...
HPDC
2011
IEEE
12 years 9 months ago
2011
IEEE
In today’s high performance computing practice, fail-stop failures are often tolerated by checkpointing. While checkpointing is a very general technique and can often be applied...