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...
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...
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...
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 ...
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...