Fully polynomial-time computation of maximum likelihood trajectories in Markov chains
Fully polynomial-time computation of maximum likelihood trajectories in Markov chains
DOI | Resolve DOI: https://doi.org/10.1016/j.ipl.2016.09.012 |
---|---|
Author | Search for: Grinberg, Yuri; Search for: Perkins, Theodore J. |
Format | Text, Article |
Journal title | Information Processing Letters |
ISSN | 0020-0190 |
Volume | 118 |
Pages | 53–57 |
Subject | Markov chains; graph algorithms; computational complexity |
Abstract | |
Publication date | 2016-10-04 |
Publisher | Elsevier |
Language | English |
Peer reviewed | Yes |
NRC publication | This is a non-NRC publication"Non-NRC publications" are publications authored by NRC employees prior to their employment by NRC. |
NPARC number | 23003079 |
Export citation | Export as RIS |
Report a correction | Report a correction | Record identifier | af470682-a960-4529-80d5-73e80ea70641 |
Record created | 2018-04-18 |
Record modified | 2020-03-16 |