Krishnamurthy, Vikram and Dey, Subhrakanti (2001) Reduced-complexity estimation for Poisson processes modulated by nearly completely decomposable Markov chains. In: Proceedings. 2001 IEEE International Symposium on Information Theory. IEEE, p. 207. ISBN 0780371232
|
Download (138kB)
| Preview
|
Abstract
In this paper, we address the problem of complexity reduction in state estimation of Poisson processes modulated by continuous-time nearly completely decomposable Markov chains.
| Item Type: | Book Section |
|---|---|
| Additional Information: | Cite as: V. Krishnamurthy and S. Dey, "Reduced-complexity estimation for Poisson processes modulated by nearly completely decomposable Markov chains," Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252), 2001, pp. 207-, doi: 10.1109/ISIT.2001.936070. |
| Keywords: | Reduced-complexity; estimation; Poisson; processes; modulated; completely decomposable; Markov chains; |
| Academic Unit: | Faculty of Science and Engineering > Electronic Engineering Faculty of Science and Engineering > Research Institutes > Hamilton Institute |
| Item ID: | 14440 |
| Identification Number: | https://doi.org/10.1109/ISIT.2001.936070 |
| Depositing User: | Laura Gallagher |
| Date Deposited: | 19 May 2021 15:06 |
| Publisher: | IEEE |
| Refereed: | Yes |
| URI: | |
| Use Licence: | This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here |
Repository Staff Only(login required)
 |
Item control page |
Downloads
Downloads per month over past year
Altmetric
Altmetric