𝔖 Bobbio Scriptorium

✦ LIBER ✦

Computational complexity of a fast Viterbi decoding algorithm for stochastic letter-phoneme transduction

✍ Scribed by Luk, R.W.P.; Damper, R.I.

Book ID: 121482437
Publisher: IEEE
Year: 1998
Tongue: English
Weight: 205 KB
Volume: 6
Category: Article
ISSN: 1063-6676
DOI: 10.1109/89.668816

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A memory-effective fast algorithm for co

A memory-effective fast algorithm for computing the reliability of complex systems/networks

✍ W.J. Rueger 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 352 KB

Fast and stable algorithms for computing

Fast and stable algorithms for computing the principal nth root of a complex matrix and the matrix sector function

✍ J.S.H. Tsai; L.S. Shieh; R.E. Yates 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 595 KB

[IEEE Proceedings of the IEEE-INNS-ENNS

[IEEE Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks. IJCNN 2000. Neural Computing: New Challenges and Perspectives for the New Millennium - Como, Italy (2000.07.27-2000.07.27)] Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks. IJCNN 2000. Neural Computing: New Challenges and Perspectives for the New Millennium - ICA of complex valued signals: a fast and robust deflationary algorithm

✍ Bingham, E.; Hyvarinen, A. 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 330 KB