113 search results - page 12 / 23 » Fast algorithms for discrete polynomial transforms |
ICIP
2001
IEEE
14 years 10 months ago
2001
IEEE
Shift variance and poor directional selectivity, two major disadvantages of the discrete wavelet transform, have previously been circumvented either by using highly redundant, non...
SAS
1997
Springer
14 years 4 days ago
1997
Springer
is an important optimization for programs that use procedural abstraction. Because inlining trades code size for execution speed, the effectiveness of an inlining algorithm is det...
ADAEUROPE
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. To handle signal processing algorithms such as the Fast Fourrier Transform (FFT) or the Discrete Cosine Transform (DCT) system designers have traditionally resorted to sp...
SIAMSC
2010
13 years 3 months ago
2010
Abstract. BDDC algorithms are constructed and analyzed for the system of almost incompressible elasticity discretized with Gauss-Lobatto-Legendre spectral elements in three dimensi...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two pol...