Discrete Denoising With Shifts
暂无分享,去创建一个
[1] David Barber,et al. Switching Linear Dynamical Systems for Noise Robust Speech Recognition , 2007, IEEE Transactions on Audio, Speech, and Language Processing.
[2] Mark Herbster,et al. Tracking the Best Expert , 1995, Machine Learning.
[3] Yoram Singer,et al. Switching Portfolios , 1998, Int. J. Neural Syst..
[4] Abraham Lempel,et al. Compression of two-dimensional data , 1986, IEEE Trans. Inf. Theory.
[5] James M. Rehg,et al. Parameterized Duration Mmodeling for Switching Linear Dynamic Systems , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).
[6] Tsachy Weissman,et al. Scanning and Sequential Decision Making for Multidimensional Data—Part II: The Noisy Case , 2008, IEEE Transactions on Information Theory.
[7] D. Siegmund,et al. Using the Generalized Likelihood Ratio Statistic for Sequential Detection of a Change-Point , 1995 .
[8] Neri Merhav,et al. Universal Filtering Via Prediction , 2007, IEEE Transactions on Information Theory.
[9] Neri Merhav,et al. Universal Prediction , 1998, IEEE Trans. Inf. Theory.
[10] Erik Ordentlich,et al. The Cost of Achieving the Best Portfolio in Hindsight , 1998, Math. Oper. Res..
[11] Tsachy Weissman,et al. Universal Minimax Discrete Denoising Under Channel Uncertainty , 2006, IEEE Transactions on Information Theory.
[12] D. Blackwell. Controlled Random Walks , 2010 .
[13] Tsachy Weissman,et al. Universal denoising for the finite-input general-output channel , 2005, IEEE Transactions on Information Theory.
[14] David Siegmund,et al. Confidence Sets in Change-point Problems , 1988 .
[15] D. Blackwell. An analog of the minimax theorem for vector payoffs. , 1956 .
[16] Manfred K. Warmuth,et al. The Weighted Majority Algorithm , 1994, Inf. Comput..
[17] Philip Wolfe,et al. Contributions to the theory of games , 1953 .
[18] Vladimir Vovk,et al. Aggregating strategies , 1990, COLT '90.
[19] Tsachy Weissman,et al. Scanning and Sequential Decision Making for Multidimensional Data–Part I: The Noiseless Case , 2007, IEEE Transactions on Information Theory.
[20] Sergio Verdú,et al. Schemes for Bidirectional Modeling of Discrete Stationary Sources , 2006, IEEE Transactions on Information Theory.
[21] F. R. Gantmakher. The Theory of Matrices , 1984 .
[22] Tsachy Weissman,et al. Multi-directional context sets with applications to universal denoising and compression , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..
[23] Tsachy Weissman,et al. A Universal Wyner-Ziv Scheme for Discrete Sources , 2007, 2007 IEEE International Symposium on Information Theory.
[24] Gábor Lugosi,et al. Prediction, learning, and games , 2006 .
[25] Neri Merhav,et al. Low-complexity sequential lossless coding for piecewise-stationary memoryless sources , 1998, IEEE Trans. Inf. Theory.
[26] Tsachy Weissman,et al. Universal Denoising of Discrete-Time Continuous-Amplitude Signals , 2006, IEEE Transactions on Information Theory.
[27] Tamás Linder,et al. Efficient adaptive algorithms and minimax bounds for zero-delay lossy source coding , 2004, IEEE Transactions on Signal Processing.
[28] Neri Merhav,et al. Hidden Markov processes , 2002, IEEE Trans. Inf. Theory.
[29] Manfred K. Warmuth,et al. Tracking a Small Set of Experts by Mixing Past Posteriors , 2003, J. Mach. Learn. Res..
[30] Tsachy Weissman,et al. Discrete denoising for channels with memory , 2005, Commun. Inf. Syst..
[31] Tsachy Weissman,et al. Universal Zero-Delay Joint Source–Channel Coding , 2006, IEEE Transactions on Information Theory.
[32] Abraham Lempel,et al. Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.
[33] James Hannan,et al. 4. APPROXIMATION TO RAYES RISK IN REPEATED PLAY , 1958 .
[34] Peter Lancaster,et al. The theory of matrices , 1969 .
[35] Andrew C. Singer,et al. Universal Switching Linear Least Squares Prediction , 2008, IEEE Transactions on Signal Processing.
[36] Frans M. J. Willems,et al. Coding for a binary independent piecewise-identically-distributed source , 1996, IEEE Trans. Inf. Theory.
[37] Tamás Linder,et al. Tracking the Best Quantizer , 2005, IEEE Transactions on Information Theory.
[38] R. Durrett. Probability: Theory and Examples , 1993 .
[39] Tsachy Weissman,et al. How to Filter an “Individual Sequence With Feedback” , 2008, IEEE Transactions on Information Theory.
[40] Daniel J. Costello,et al. On the redundancy of universal lossless coding for general piecewise stationary sources , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).
[41] Tsachy Weissman,et al. Universal discrete denoising: known channel , 2003, IEEE Transactions on Information Theory.
[42] J. M. Bilbao,et al. Contributions to the Theory of Games , 2005 .
[43] Sergio Verdú,et al. Universal Algorithms for Channel Decoding of Uncompressed Sources , 2008, IEEE Transactions on Information Theory.
[44] Tamás Linder,et al. Efficient algorithms and minimax bounds for zero-delay lossy source coding , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..