| 2011 | ||
|---|---|---|
| c15 | ||
| c14 | ||
| 2010 | ||
| j38 | Jorma Rissanen, Teemu Roos, Petri Myllymäki: Model selection by sequentially normalized least squares. J. Multivariate Analysis 101(4): 839-849 (2010) | |
| r1 | Jorma Rissanen: Minimum Description Length Principle. Encyclopedia of Machine Learning 2010: 666-668 | |
| 2009 | ||
| j37 | Teemu Roos, Petri Myllymäki, Jorma Rissanen: MDL denoising revisited. IEEE Transactions on Signal Processing 57(9): 3347-3360 (2009) | |
| 2008 | ||
| j36 | ||
| 2007 | ||
| j35 | Jorma Rissanen, Peter D. Grünwald, Jukka Heikkonen, Petri Myllymäki, Teemu Roos, Juho Rousu: Information Theoretic Methods for Bioinformatics. EURASIP J. Bioinformatics and Systems Biology 2007 (2007) | |
| c13 | Ioan Tabus, Jorma Rissanen, Jaakko Astola: Normalized maximum likelihood models for genomics. ISSPA 2007: 1-6 | |
| 2006 | ||
| j34 | Jorma Rissanen: The Structure Function and Distinguishable Models of Data. Comput. J. 49(6): 657-664 (2006) | |
| j33 | Ioan Tabus, Andrea Hategan, Cristian Mircean, Jorma Rissanen, Ilya Shmulevich, Wei Zhang, Jaakko Astola: Nonlinear modeling of protein expressions in protein arrays. IEEE Transactions on Signal Processing 54(6-2): 2394-2407 (2006) | |
| j32 | Vibhor Kumar, Jukka Heikkonen, Jorma Rissanen, Kimmo Kaski: Minimum Description Length Denoising With Histogram Models. IEEE Transactions on Signal Processing 54(8): 2922-2928 (2006) | |
| i1 | ||
| 2005 | ||
| c12 | Gergely Korodi, Jorma Rissanen, Ioan Tabus: Lossless Data Compression Using Optimal Tree Machines. DCC 2005: 348-357 | |
| 2004 | ||
| c11 | Adriana Vasilache, Ioan Tabus, Jorma Rissanen: Algorithms for Constructing Min-Max Partitions of the Parameter Space for MDL Inference. SSPR/SPR 2004: 930-938 | |
| 2003 | ||
| j31 | Ioan Tabus, Jorma Rissanen, Jaakko Astola: Classification and feature gene selection using the normalized maximum likelihood model for discrete regression. Signal Processing 83(4): 713-727 (2003) | |
| j30 | Jorma Rissanen: Complexity of simple nonlogarithmic loss functions. IEEE Transactions on Information Theory 49(2): 476-484 (2003) | |
| c10 | Ioan Tabus, Gergely Korodi, Jorma Rissanen: DNA sequence compression using the normalized maximum likelihood model for discrete regression . DCC 2003: 253-262 | |
| 2002 | ||
| j29 | Ioan Tabus, Jorma Rissanen: Asymptotics of greedy algorithms for variable-to-fixed length coding of Markov sources. IEEE Transactions on Information Theory 48(7): 2022-2035 (2002) | |
| 2001 | ||
| j28 | Jorma Rissanen: Strong optimality of the normalized ML models as universal codes and information in data. IEEE Transactions on Information Theory 47(5): 1712-1717 (2001) | |
| 2000 | ||
| j27 | ||
| c9 | Ioan Tabus, Gergely Korodi, Jorma Rissanen: Text Compression Based on Variable-to-Fixed Codes for Markov Sources. Data Compression Conference 2000: 133-142 | |
| 1999 | ||
| j26 | Jorma Rissanen: Hypothesis Selection and Testing by the MDL Principle. Comput. J. 42(4): 260-269 (1999) | |
| j25 | Jorma Rissanen: Discussion of Paper 'Minimum Message Length and Kolmogorov Complexity' by C. S. Wallace and D. L. Dowe. Comput. J. 42(4): 327-329 (1999) | |
| j24 | ||
| j23 | Jorma Rissanen: Fast Universal Coding With Context Models. IEEE Transactions on Information Theory 45(4): 1065-1071 (1999) | |
| 1998 | ||
| j22 | Andrew R. Barron, Jorma Rissanen, Bin Yu: The Minimum Description Length Principle in Coding and Modeling. IEEE Transactions on Information Theory 44(6): 2743-2760 (1998) | |
| 1997 | ||
| j21 | ||
| c8 | Ioan Tabus, Jorma Rissanen, Jaakko Astola: Adaptive L-Predictors Based on Finite State Machine Context Selection. ICIP (1) 1997: 401-404 | |
| 1996 | ||
| j20 | Marcelo J. Weinberger, Jorma Rissanen, Ronald Arps: Applications of universal context modeling to lossless compression of gray-scale images. IEEE Transactions on Image Processing 5(4): 575-586 (1996) | |
| j19 | Jorma Rissanen: Fisher information and stochastic complexity. IEEE Transactions on Information Theory 42(1): 40-47 (1996) | |
| j18 | Søren Forchhammer, Jorma Rissanen: Partially hidden Markov models. IEEE Transactions on Information Theory 42(4): 1253-1256 (1996) | |
| c7 | Manish Mehta, Rakesh Agrawal, Jorma Rissanen: SLIQ: A Fast Scalable Classifier for Data Mining. EDBT 1996: 18-32 | |
| 1995 | ||
| j17 | Marcelo J. Weinberger, Jorma Rissanen, Meir Feder: A universal finite memory source. IEEE Transactions on Information Theory 41(3): 643-652 (1995) | |
| c6 | Søren Forchhammer, Jorma Rissanen: Coding with Partially Hidden Markov Models. Data Compression Conference 1995: 92-101 | |
| c5 | ||
| c4 | ||
| 1992 | ||
| j16 | Jorma Rissanen, Terry P. Speed, Bin Yu: Density estimation by stochastic complexity. IEEE Transactions on Information Theory 38(2): 315-323 (1992) | |
| 1989 | ||
| j15 | Jorma Rissanen, Kottappuram Mohammed Mohiuddin: A multiplication-free multialphabet arithmetic code. IEEE Transactions on Communications 37(2): 93-98 (1989) | |
| 1987 | ||
| j14 | Jorma Rissanen, Marl Wax: Measures of mutual and causal dependence between two time series. IEEE Transactions on Information Theory 33(4): 598-601 (1987) | |
| 1986 | ||
| j13 | Jorma Rissanen: Complexity of strings in the class of Markov sources. IEEE Transactions on Information Theory 32(4): 526-532 (1986) | |
| 1985 | ||
| j12 | Stephen Todd, Glen G. Langdon Jr., Jorma Rissanen: Parameter Reduction and Context Selection for Compression of Gray-Scale Images. IBM Journal of Research and Development 29(2): 188-193 (1985) | |
| 1984 | ||
| j11 | Jorma Rissanen: Universal coding, information, prediction, and estimation. IEEE Transactions on Information Theory 30(4): 629-636 (1984) | |
| 1983 | ||
| j10 | Jorma Rissanen: A universal data compression system. IEEE Transactions on Information Theory 29(5): 656-663 (1983) | |
| j9 | Glen G. Langdon Jr., Jorma Rissanen: Correction to 'A simple general binary source code' (Sep 82 800-803). IEEE Transactions on Information Theory 29(5): 778-779 (1983) | |
| 1982 | ||
| j8 | Jorma Rissanen: Tight lower bounds for optimum code length. IEEE Transactions on Information Theory 28(2): 348-349 (1982) | |
| j7 | Glen G. Langdon Jr., Jorma Rissanen: A simple general binary source code. IEEE Transactions on Information Theory 28(5): 800-803 (1982) | |
| c3 | ||
| 1981 | ||
| j6 | Jorma Rissanen, Glen G. Langdon Jr.: Universal modeling and coding. IEEE Transactions on Information Theory 27(1): 12-22 (1981) | |
| 1979 | ||
| j5 | Jorma Rissanen, Glen G. Langdon Jr.: Arithmetic Coding. IBM Journal of Research and Development 23(2): 149-162 (1979) | |
| 1978 | ||
| c2 | ||
| 1977 | ||
| j4 | ||
| 1976 | ||
| j3 | Jorma Rissanen: Generalized Kraft Inequality and Arithmetic Coding. IBM Journal of Research and Development 20(3): 198-203 (1976) | |
| 1974 | ||
| c1 | Jorma Rissanen, Bostwick F. Wyman: Duals of input/output maps. Category Theory Applied to Computation and Control 1974: 204-208 | |
| 1973 | ||
| j2 | Jorma Rissanen: Bounds for Weight Balanced Trees. IBM Journal of Research and Development 17(2): 101-105 (1973) | |
| 1963 | ||
| j1 | ||
Colors in the list of coauthors
Last update Mon May 20 22:49:30 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page