401 search results - page 14 / 81 » Group-theoretic Algorithms for Matrix Multiplication |
ISPDC
2010
IEEE
14 years 10 months ago
2010
IEEE
—With systems such as Road Runner, there is a trend in super computing to offload parallel tasks to special purpose co-processors, composed of many relatively simple scalar proc...
155
click to vote
PARLE
1994
15 years 3 months ago
1994
Sparse matrix-vector multiplication forms the heart of iterative linear solvers used widely in scientific computations (e.g., finite element methods). In such solvers, the matrix-v...
138
click to vote
ARC
2010
Springer
15 years 6 months ago
2010
Springer
Computing the solution to a system of linear equations is a fundamental problem in scientific computing, and its acceleration has drawn wide interest in the FPGA community [1–3]...
117
click to vote
ICASSP
2009
IEEE
14 years 9 months ago
2009
IEEE
Nonnegative matrix tri-factorization (NMTF) is a 3-factor decomposition of a nonnegative data matrix, X USV , where factor matrices, U, S, and V , are restricted to be nonnegativ...
ICCD
2005
IEEE
15 years 8 months ago
2005
IEEE
FPGAs (Field-Programmable Gate Arrays) are often used as coprocessors to boost the performance of dataintensive applications [1, 2]. However, mapping algorithms onto multimillion-...