Sciweavers

539 search results - page 3 / 108
» Recurrence relations and fast algorithms
Sort
View
STRINGOLOGY
2008
13 years 7 months ago
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
JSC
2008
96views more  JSC 2008»
13 years 5 months ago
Computing the algebraic relations of C-finite sequences and multisequences
We present an algorithm for computing generators for the ideal of algebraic relations among sequences which are given by homogeneous linear recurrence equations with constant coef...
Manuel Kauers, Burkhard Zimmermann
TNN
2008
138views more  TNN 2008»
13 years 5 months ago
A Fast and Scalable Recurrent Neural Network Based on Stochastic Meta Descent
This brief presents an efficient and scalable online learning algorithm for recurrent neural networks (RNNs). The approach is based on the real-time recurrent learning (RTRL) algor...
Zhenzhen Liu, Itamar Elhanany
COMBINATORICS
2006
137views more  COMBINATORICS 2006»
13 years 5 months ago
Three-Letter-Pattern-Avoiding Permutations and Functional Equations
We present an algorithm for finding a system of recurrence relations for the number of permutations of length n that satisfy a certain set of conditions. A rewriting of these rela...
Ghassan Firro, Toufik Mansour
NA
2010
95views more  NA 2010»
13 years 16 days ago
A new algorithm for computing the Geronimus transformation with large shifts
Abstract A monic Jacobi matrix is a tridiagonal matrix which contains the parameters of the three-term recurrence relation satisfied by the sequence of monic polynomials orthogonal...
Maria Isabel Bueno Cachadina, Alfredo Deaño...