Data-Efficient Quickest Change Detection in Minimax Settings

DOI10.1109/TIT.2013.2272313zbMath1364.94181arXiv1211.3729OpenAlexW2019946858MaRDI QIDQ5346334

Taposh Banerjee, Venugopal V. Veeravalli

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1211.3729

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13)

Related Items (6)

An analytic expression for the distribution of the generalized Shiryaev-Roberts diffusion. The Fourier spectral expansion approach ⋮ Sequential algorithms for moving anomaly detection in networks ⋮ Modeling and quickest detection of a rapidly approaching object ⋮ Quickest Detection with Discretely Controlled Observations ⋮ Data-Efficient Minimax Quickest Change Detection in a Decentralized System ⋮ A quickest detection problem with an observation cost

This page was built for publication: Data-Efficient Quickest Change Detection in Minimax Settings