Optimizing the Forward Algorithm for Hidden Markov Model on IBM Roadrunner clusters
In this paper we present a parallel solution of the Forward Algorithm for Hidden Markov Models. The Forward algorithm compute a probability of a hidden state from Markov model at a certain time, this process being recursively. The whole process requires large computational resources for those mo...
Main Authors: | SOIMAN, S.-I., RUSU, I., PENTIUC, S.-G. |
---|---|
Format: | Article |
Language: | English |
Published: |
Stefan cel Mare University of Suceava
2015-05-01
|
Series: | Advances in Electrical and Computer Engineering |
Subjects: | |
Online Access: | http://dx.doi.org/10.4316/AECE.2015.02013 |
Similar Items
-
Algorithms for Hidden Markov Models Restricted to Occurrences of Regular Expressions
by: Thomas Mailund, et al.
Published: (2013-11-01) -
A Performance Evaluation of QR-eigensolver on IBM Roadrunner cluster for Large Sparse Matrices
by: Ionela RUSU, et al.
Published: (2013-01-01) -
Evaluation of vicinity-based hidden Markov models for genotype imputation
by: Su Wang, et al.
Published: (2022-08-01) -
Correcting Insertions/Deletions in DPPM Using Hidden Markov Model
by: Weigang Chen, et al.
Published: (2020-01-01) -
NVIDIA CUDA application to train and decode the Hidden Markov Models
by: Pavel Zatsepin, et al.
Published: (2019-05-01)