A lower bound for the detection/isolation delay in a class of sequential tests
From MaRDI portal
Publication:3547432
DOI10.1109/TIT.2003.818398zbMATH Open1301.94035MaRDI QIDQ3547432FDOQ3547432
Authors: Igor Nikiforov
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
Cited In (13)
- Quickest detection problems: fifty years later
- Sequential change diagnosis revisited and the Adaptive Matrix CuSum
- Minimax and pointwise sequential changepoint detection and identification for general stochastic models
- Detection and identification of changes of hidden Markov chains: asymptotic theory
- A fixed-size sample strategy for the sequential detection and isolation of non-orthogonal alterna\-tives
- Quickest change detection in statistically periodic processes with unknown post-change distribution
- Multidecision Quickest Change-Point Detection: Previous Achievements and Open Problems
- Sequential detection/isolation of abrupt changes
- Title not available (Why is that?)
- Quickest Multidecision Abrupt Change Detection with Some Applications to Network Monitoring
- Discussion on ``Quickest detection problems: fifty years later by Albert N. Shiryaev
- A discussion on ``Detection of intrusions in information systems by sequential change-point methods by Tartakovsky, Rozovskii, Blažek, and Kim
- Adaptive threshold computation for CUSUM-type procedures in change detection and isolation problems
This page was built for publication: A lower bound for the detection/isolation delay in a class of sequential tests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547432)