Decentralized quickest change detection
From MaRDI portal
Publication:4544610
DOI10.1109/18.923755zbMath1017.94516OpenAlexW2104248329MaRDI QIDQ4544610
Publication date: 4 August 2002
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.923755
Bayesian problems; characterization of Bayes procedures (62C10) Detection theory in information and communication theory (94A13)
Related Items (13)
Large-Scale Datastreams Surveillance via Pattern-Oriented-Sampling ⋮ Online monitoring of high-dimensional binary data streams with application to extreme weather surveillance ⋮ Sequential decision aggregation with social pressure ⋮ Sequential Sensor Installation for Wiener Disorder Detection ⋮ High-dimensional change-point estimation: combining filtering with convex optimization ⋮ A setwise EWMA scheme for monitoring high-dimensional datastreams ⋮ Dynamic games among teams with delayed intra-team information sharing ⋮ Asymptotically Optimal Quickest Change Detection in Distributed Sensor Systems ⋮ Data-Efficient Quickest Change Detection with On–Off Observation Control ⋮ Asymptotic statistical properties of communication-efficient quickest detection schemes in sensor networks ⋮ Consensus-based page's test in sensor networks ⋮ Byzantine Fault Tolerant Distributed Quickest Change Detection ⋮ Data-Efficient Minimax Quickest Change Detection in a Decentralized System
This page was built for publication: Decentralized quickest change detection
