539 search results - page 1 / 108 » Recurrence relations and fast algorithms |
CORR
2006
Springer
13 years 4 months ago
2006
Springer
We construct fast algorithms for evaluating transforms associated with families of functions which satisfy recurrence relations. These include algorithms both for computing the co...
MOC
1998
13 years 4 months ago
1998
Consider the Vandermonde-like matrix P := (Pk(cos jπ N ))N j,k=0, where the polynomials Pk satisfy a three-term recurrence relation. If Pk are the Chebyshev polynomials Tk, then P...
TNN
1998
13 years 4 months ago
1998
— In this work, a probabilistic model is established for recurrent networks. The EM (expectation-maximization) algorithm is then applied to derive a new fast training algorithm f...
AAECC
1998
Springer
13 years 4 months ago
1998
Springer
The set of all linear recurrence relations satisfied by given sequences of finite length is described by the annihilator ideal of the sequences. The MasseyDing algorithm to compu...
STOC
1991
ACM
13 years 8 months ago
1991
ACM