Sciweavers

10146 search results - page 92 / 2030
» Fast FAST
Sort
View
CORR
2006
Springer
151views Education» more  CORR 2006»
15 years 2 months ago
Fast matrix multiplication is stable
We perform forward error analysis for a large class of recursive matrix multiplication algorithms in the spirit of [D. Bini and G. Lotti, Stability of fast algorithms for matrix m...
James Demmel, Ioana Dumitriu, Olga Holtz, Robert K...
IJON
2006
79views more  IJON 2006»
15 years 2 months ago
Fast computation with neural oscillators
This paper studies new spike-based models for winner-take-all computation and coincidence detection. In both cases, very fast convergence is achieved independent of initial condit...
Wei Wang 0008, Jean-Jacques E. Slotine
JSC
2006
76views more  JSC 2006»
15 years 2 months ago
Fast computation of special resultants
We propose fast algorithms for computing composed products and composed sums, as well as diamond products of univariate polynomials. These operations correspond to special multiva...
Alin Bostan, Philippe Flajolet, Bruno Salvy, &Eacu...
PAMI
2006
206views more  PAMI 2006»
15 years 2 months ago
Fast Active Appearance Model Search Using Canonical Correlation Analysis
A fast AAM search algorithm based on canonical correlation analysis (CCA-AAM) is introduced. It efficiently models the dependency between texture residuals and model parameters dur...
Rene Donner, Michael Reiter, Georg Langs, Philipp ...
100
Voted
SIGPRO
2008
130views more  SIGPRO 2008»
15 years 2 months ago
A fast algorithm for the computation of 2-D forward and inverse MDCT
A fast algorithm for computing the two-dimensional (2-D) forward and inverse modified discrete cosine transform (MDCT and IMDCT) is proposed. The algorithm converts the 2-D MDCT an...
J. S. Wu, Huazhong Shu, Lotfi Senhadji, Limin Luo