𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast algorithm for repeated computation of linear recurrence relations

✍ Scribed by Jozef Mikloško

Publisher
Springer Netherlands
Year
1977
Tongue
English
Weight
333 KB
Volume
17
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A novel algorithm for fast computation o
A novel algorithm for fast computation of Zernike moments
✍ J. Gu; H.Z. Shu; C. Toumoulin; L.M. Luo 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 369 KB

Zernike moments (ZMs) have been successfully used in pattern recognition and image analysis due to their good properties of orthogonality and rotation invariance. However, their computation by a direct method is too expensive, which limits the application of ZMs. In this paper, we present a novel al

A fast algorithm for index of annihilati
A fast algorithm for index of annihilation computations
✍ P.Y. Yalamov; M. Mitrouli 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 110 KB

In this paper a fast algorithm for computing the index of annihilation of the associated pencil of a given matrix is presented. Knowledge of this index leads us to the speciÿcation of the elementary divisors of the matrix and thus we can specify its canonical forms. It is shown that the new algorith

A fast algorithm for genome-wide analysi
A fast algorithm for genome-wide analysis of proteins with repeated sequences
✍ Matteo Pellegrini; Edward M. Marcotte; Todd O. Yeates 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB

We present a fast algorithm to search for repeating fragments within protein sequences. The technique is based on an extension of the Smith-Waterman algorithm that allows the calculation of sub-optimal alignments of a sequence against itself. We are able to estimate the statistical significance of a