416 search results - page 25 / 84 » A Paradigm for Parallel Matrix Algorithms: |
113
click to vote
PARA
1994
Springer
15 years 8 months ago
1994
Springer
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that...
163
click to vote
ICS
2007
Tsinghua U.
15 years 10 months ago
2007
Tsinghua U.
Strassen’s matrix multiplication (MM) has benefits with respect to any (highly tuned) implementations of MM because Strassen’s reduces the total number of operations. Strasse...
152
Voted
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
156
click to vote
FPGA
2005
ACM
15 years 9 months ago
2005
ACM
Floating-point Sparse Matrix-Vector Multiplication (SpMXV) is a key computational kernel in scientific and engineering applications. The poor data locality of sparse matrices sig...
167
click to vote
COLT
2010
Springer
15 years 2 months ago
2010
Springer
We describe online algorithms for learning a rotation from pairs of unit vectors in Rn . We show that the expected regret of our online algorithm compared to the best fixed rotati...