269 search results - page 21 / 54 » Computing the inverse sort transform in linear time |
116
click to vote
DAC
2009
ACM
16 years 5 months ago
2009
ACM
State-of-the-art integral-equation-based solvers rely on techniques that can perform a matrix-vector multiplication in O(N) complexity. In this work, a fast inverse of linear comp...
142
Voted
MLMI
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper proposes an analysis technique for wide-band audio applications based on the predictability of the temporal evolution of Quadrature Mirror Filter (QMF) sub-ban...
161
click to vote
EUROPAR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Limited bandwidth to off-chip main memory is a performance bottleneck in chip multiprocessors for streaming computations, such as Cell/B.E., and this will become even mor...
164
click to vote
STACS
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
151
click to vote
SIAMCOMP
2002
15 years 3 months ago
2002
Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quan...