𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient ARX identification algorithms with full parallelism

✍ Scribed by Karaboyas, S.; Kalouptsidis, N.; Caroubalos, C.

Book ID
114559223
Publisher
IEEE
Year
1990
Weight
869 KB
Volume
38
Category
Article
ISSN
0096-3518

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Convergence analysis of the RLS identifi
Convergence analysis of the RLS identification algorithm with exponential forgetting in stationary ARX-structures
✍ B. Lindoff; J. Holst πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 171 KB πŸ‘ 2 views

The recursive least-squares (RLS) identiΓΏcation algorithm is often extended with exponential forgetting as a tool for parameter estimation in time-varying stochastic systems. The statistical properties of the parameter estimates obtained from such an extended RLS-algorithm depend in a non-linear way

Efficient Parallel Algorithms for Hierar
Efficient Parallel Algorithms for Hierarchical Clustering on Arrays with Reconfigurable Optical Buses
✍ Chin-Hsiung Wu; Shi-Jinn Horng; Horng-Ren Tsai πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 225 KB

Clustering is a basic operation in image processing and computer vision, and it plays an important role in unsupervised pattern recognition and image segmentation. While there are many methods for clustering, the single-link hierarchical clustering is one of the most popular techniques. In this pape