2008 |
44 | EE | Jorma Rissanen:
Minimum description length.
Scholarpedia 3(8): 6727 (2008) |
2006 |
43 | EE | Teemu Roos,
Petri Myllymäki,
Jorma Rissanen:
MDL Denoising Revisited
CoRR abs/cs/0609138: (2006) |
42 | EE | Jorma Rissanen:
The Structure Function and Distinguishable Models of Data.
Comput. J. 49(6): 657-664 (2006) |
2005 |
41 | EE | Gergely Korodi,
Jorma Rissanen,
Ioan Tabus:
Lossless Data Compression Using Optimal Tree Machines.
DCC 2005: 348-357 |
2004 |
40 | EE | 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 |
39 | EE | Ioan Tabus,
Gergely Korodi,
Jorma Rissanen:
DNA sequence compression using the normalized maximum likelihood model for discrete regression .
DCC 2003: 253-262 |
38 | | Jorma Rissanen:
Complexity of simple nonlogarithmic loss functions.
IEEE Transactions on Information Theory 49(2): 476-484 (2003) |
37 | EE | 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) |
2002 |
36 | | 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 |
35 | | 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 |
34 | EE | Ioan Tabus,
Gergely Korodi,
Jorma Rissanen:
Text Compression Based on Variable-to-Fixed Codes for Markov Sources.
Data Compression Conference 2000: 133-142 |
33 | | Jorma Rissanen:
MDL Denoising.
IEEE Transactions on Information Theory 46(7): 2537-2543 (2000) |
1999 |
32 | | Jorma Rissanen:
Hypothesis Selection and Testing by the MDL Principle.
Comput. J. 42(4): 260-269 (1999) |
31 | | 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) |
30 | | Jorma Rissanen:
Rejoinder.
Comput. J. 42(4): 343-344 (1999) |
29 | | Jorma Rissanen:
Fast Universal Coding With Context Models.
IEEE Transactions on Information Theory 45(4): 1065-1071 (1999) |
1998 |
28 | | Andrew R. Barron,
Jorma Rissanen,
Bin Yu:
The Minimum Description Length Principle in Coding and Modeling.
IEEE Transactions on Information Theory 44(6): 2743- (1998) |
1997 |
27 | EE | Ioan Tabus,
Jorma Rissanen,
Jaakko Astola:
Adaptive L-Predictors Based on Finite State Machine Context Selection.
ICIP (1) 1997: 401-404 |
26 | | Jorma Rissanen:
Stochastic Complexity in Learning.
J. Comput. Syst. Sci. 55(1): 89-95 (1997) |
1996 |
25 | EE | Manish Mehta,
Rakesh Agrawal,
Jorma Rissanen:
SLIQ: A Fast Scalable Classifier for Data Mining.
EDBT 1996: 18-32 |
24 | EE | 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) |
23 | | Jorma Rissanen:
Fisher information and stochastic complexity.
IEEE Transactions on Information Theory 42(1): 40-47 (1996) |
22 | | Søren Forchhammer,
Jorma Rissanen:
Partially hidden Markov models.
IEEE Transactions on Information Theory 42(4): 1253-1256 (1996) |
1995 |
21 | | Søren Forchhammer,
Jorma Rissanen:
Coding with Partially Hidden Markov Models.
Data Compression Conference 1995: 92-101 |
20 | | Jorma Rissanen:
Stochastic complexity in learning.
EuroCOLT 1995: 196-210 |
19 | | Manish Mehta,
Jorma Rissanen,
Rakesh Agrawal:
MDL-Based Decision Tree Pruning.
KDD 1995: 216-221 |
18 | | Marcelo J. Weinberger,
Jorma Rissanen,
Meir Feder:
A universal finite memory source.
IEEE Transactions on Information Theory 41(3): 643-652 (1995) |
1992 |
17 | | Jorma Rissanen,
Terry P. Speed,
Bin Yu:
Density estimation by stochastic complexity.
IEEE Transactions on Information Theory 38(2): 315-323 (1992) |
1987 |
16 | | Jorma Rissanen,
Marl Wax:
Measures of mutual and causal dependence between two time series.
IEEE Transactions on Information Theory 33(4): 598- (1987) |
1986 |
15 | | Jorma Rissanen:
Complexity of strings in the class of Markov sources.
IEEE Transactions on Information Theory 32(4): 526-532 (1986) |
1985 |
14 | | 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 |
13 | | Jorma Rissanen:
Universal coding, information, prediction, and estimation.
IEEE Transactions on Information Theory 30(4): 629-636 (1984) |
1983 |
12 | | Jorma Rissanen:
A universal data compression system.
IEEE Transactions on Information Theory 29(5): 656-663 (1983) |
11 | | 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- (1983) |
1982 |
10 | EE | Jorma Rissanen:
On Equivalences of Database Schemes.
PODS 1982: 23-26 |
9 | | Jorma Rissanen:
Tight lower bounds for optimum code length.
IEEE Transactions on Information Theory 28(2): 348- (1982) |
8 | | Glen G. Langdon Jr.,
Jorma Rissanen:
A simple general binary source code.
IEEE Transactions on Information Theory 28(5): 800- (1982) |
1981 |
7 | | Jorma Rissanen,
Glen G. Langdon Jr.:
Universal modeling and coding.
IEEE Transactions on Information Theory 27(1): 12-22 (1981) |
1979 |
6 | | Jorma Rissanen,
Glen G. Langdon Jr.:
Arithmetic Coding.
IBM Journal of Research and Development 23(2): 149-162 (1979) |
1978 |
5 | | Jorma Rissanen:
Theory of Relations for Databases - A Tutorial Survey.
MFCS 1978: 536-551 |
1977 |
4 | EE | Jorma Rissanen:
Independent Components of Relations.
ACM Trans. Database Syst. 2(4): 317-325 (1977) |
1976 |
3 | | Jorma Rissanen:
Generalized Kraft Inequality and Arithmetic Coding.
IBM Journal of Research and Development 20(3): 198-203 (1976) |
1974 |
2 | | Jorma Rissanen,
Bostwick F. Wyman:
Duals of input/output maps.
Category Theory Applied to Computation and Control 1974: 204-208 |
1973 |
1 | | Jorma Rissanen:
Bounds for Weight Balanced Trees.
IBM Journal of Research and Development 17(2): 101-105 (1973) |