507 search results - page 20 / 102 » Computing Sparse Multiples of Polynomials |
IRREGULAR
1995
Springer
13 years 11 months ago
1995
Springer
Sparse matrix problems are di cult to parallelize e ciently on message-passing machines, since they access data through multiple levels of indirection. Inspector executor strategie...
CSE
2009
IEEE
13 years 11 months ago
2009
IEEE
Sparse Matrix-Vector multiplication (SpMV) is a very challenging computational kernel, since its performance depends greatly on both the input matrix and the underlying architectur...
WAIFI
2010
Springer
14 years 23 days ago
2010
Springer
In the 1990s and early 2000s several papers investigated the relative merits of polynomial-basis and normal-basis computations for F2n . Even for particularly squaring-friendly app...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Frames have established themselves as a means to derive redundant, yet stable decompositions of a signal for analysis or transmission, while also promoting sparse expansions. Howe...
ICTCS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...