{"title":"Viterbi算法最有信息量的停止时间:顺序属性","authors":"J. Kogan","doi":"10.1109/WITS.1994.513916","DOIUrl":null,"url":null,"abstract":"Sequential properties of the Viterbi algorithm are studied based on a renewal sequence of the most informative stopping times which can be explicitly found during the Viterbi recognition of the most likeliest hidden Markovian state-sequence.","PeriodicalId":423518,"journal":{"name":"Proceedings of 1994 Workshop on Information Theory and Statistics","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The most informative stopping times for Viterbi algorithm: sequential properties\",\"authors\":\"J. Kogan\",\"doi\":\"10.1109/WITS.1994.513916\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Sequential properties of the Viterbi algorithm are studied based on a renewal sequence of the most informative stopping times which can be explicitly found during the Viterbi recognition of the most likeliest hidden Markovian state-sequence.\",\"PeriodicalId\":423518,\"journal\":{\"name\":\"Proceedings of 1994 Workshop on Information Theory and Statistics\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-10-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1994 Workshop on Information Theory and Statistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WITS.1994.513916\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1994 Workshop on Information Theory and Statistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WITS.1994.513916","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The most informative stopping times for Viterbi algorithm: sequential properties
Sequential properties of the Viterbi algorithm are studied based on a renewal sequence of the most informative stopping times which can be explicitly found during the Viterbi recognition of the most likeliest hidden Markovian state-sequence.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
