On the Subexponential Decay of Detection Error Probabilities in Long Tandems
暂无分享,去创建一个
[1] T. Cover. Hypothesis Testing with Finite Statistics , 1969 .
[2] Jack Koplowitz,et al. Necessary and sufficient memory size for m-hypothesis testing , 1975, IEEE Trans. Inf. Theory.
[3] B. Chandrasekaran,et al. A finite-memory deterministic algorithm for the symmetric hypothesis testing problem , 1975, IEEE Trans. Inf. Theory.
[4] P. Bickel,et al. Mathematical Statistics: Basic Ideas and Selected Topics , 1977 .
[5] Ramanarayanan Viswanathan,et al. Optimal serial distributed decision fusion , 1987, 26th IEEE Conference on Decision and Control.
[6] John N. Tsitsiklis,et al. Decentralized detection by a large number of sensors , 1988, Math. Control. Signals Syst..
[7] R. Durrett. Probability: Theory and Examples , 1993 .
[8] D. Kleinman,et al. Optimization of detection networks. I. Tandem structures , 1990, 1990 IEEE International Conference on Systems, Man, and Cybernetics Conference Proceedings.
[9] M. Athans,et al. Distributed detection by a large team of sensors in tandem , 1992 .
[10] J. Tsitsiklis. Decentralized Detection' , 1993 .
[11] John N. Tsitsiklis,et al. Extremal properties of likelihood-ratio quantizers , 1993, IEEE Trans. Commun..
[12] P. F. Swaszek,et al. On the performance of serial networks in distributed detection , 1993 .
[13] Pramod K. Varshney,et al. Distributed detection with multiple sensors I. Fundamentals , 1997, Proc. IEEE.
[14] Amir Dembo,et al. Large Deviations Techniques and Applications , 1998 .
[15] M. Dahleh. Laboratory for Information and Decision Systems , 2005 .
[16] Moe Z. Win,et al. On the Subexponential Decay of Detection Error Probabilities in Long Tandems , 2008, IEEE Trans. Inf. Theory.
[17] Moe Z. Win,et al. Data Fusion Trees for Detection: Does Architecture Matter? , 2008, IEEE Transactions on Information Theory.
[18] Wee Peng Tay. Decentralized detection in resource-limited sensor network architectures , 2008 .