发布求助
文献互助 智能选刊 最新文献

由几乎完全可分解马尔可夫链调制的泊松过程的简化复杂性估计

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252) Pub Date : 2001-06-24 DOI:10.1109/ISIT.2001.936070
Vikram Krishnamurthy, Subhrakanti Dey
{"title":"由几乎完全可分解马尔可夫链调制的泊松过程的简化复杂性估计","authors":"Vikram Krishnamurthy, Subhrakanti Dey","doi":"10.1109/ISIT.2001.936070","DOIUrl":null,"url":null,"abstract":"We address the problem of complexity reduction in state estimation of Poisson processes modulated by continuous-time nearly completely decomposable Markov chains.","PeriodicalId":433761,"journal":{"name":"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Reduced-complexity estimation for Poisson processes modulated by nearly completely decomposable Markov chains\",\"authors\":\"Vikram Krishnamurthy, Subhrakanti Dey\",\"doi\":\"10.1109/ISIT.2001.936070\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We address the problem of complexity reduction in state estimation of Poisson processes modulated by continuous-time nearly completely decomposable Markov chains.\",\"PeriodicalId\":433761,\"journal\":{\"name\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"volume\":\"81 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2001.936070\",\"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. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2001.936070","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

研究了由连续时间几乎完全可分解马尔可夫链调制的泊松过程状态估计的复杂性降低问题。
本文章由计算机程序翻译，如有差异，请以英文原文为准。
分享
查看原文 本刊更多论文
Reduced-complexity estimation for Poisson processes modulated by nearly completely decomposable Markov chains
We address the problem of complexity reduction in state estimation of Poisson processes modulated by continuous-time nearly completely decomposable Markov chains.
求助全文
通过发布文献求助，成功后即可免费获取论文全文。 去求助
来源期刊
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信