An asymptotically least-favorable Chernoff bound for a large class of dependent data processes
暂无分享,去创建一个
[1] P. Ney,et al. Large deviations of uniformly recurrent Markov additive processes , 1985 .
[2] P. Ney,et al. Markov Additive Processes I. Eigenvalue Properties and Limit Theorems , 1987 .
[3] P. Ney. Dominating Points and the Asymptotics of Large Deviations for Random Walk on $\mathbb{R}^d$ , 1983 .
[4] R. Ellis,et al. LARGE DEVIATIONS FOR A GENERAL-CLASS OF RANDOM VECTORS , 1984 .
[5] P. J. Huber,et al. Minimax Tests and the Neyman-Pearson Lemma for Capacities , 1973 .
[6] Gary L. Wise,et al. Asymptotic memoryless discrete-time detection of phi-mixing signals in phi-mixing noise , 1984, IEEE Trans. Inf. Theory.
[7] Peter Ney,et al. Convexity and Large Deviations , 1984 .
[8] R. Ellis,et al. Entropy, large deviations, and statistical mechanics , 1985 .
[9] E. Nummelin. General irreducible Markov chains and non-negative operators: List of symbols and notation , 1984 .
[10] John S. Sadowsky. A maximum variance model for robust detection and estimation with dependent data , 1986, IEEE Trans. Inf. Theory.
[11] P. Ney,et al. MARKOV ADDITIVE PROCESSES II. LARGE DEVIATIONS , 1987 .
[12] S.A. Kassam,et al. Robust techniques for signal processing: A survey , 1985, Proceedings of the IEEE.
[13] H. Vincent Poor,et al. Memoryless discrete-time detection of a constant signal in m-dependent noise , 1979, IEEE Trans. Inf. Theory.
[14] A. Acosta,et al. Upper bounds for large deviations of dependent random vectors , 1985 .