The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jorma Rissanen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jorma Rissanen
    Independent Components of Relations. [Citation Graph (53, 5)][DBLP]
    ACM Trans. Database Syst., 1977, v:2, n:4, pp:317-325 [Journal]
  2. Jorma Rissanen
    Theory of Relations for Databases - A Tutorial Survey. [Citation Graph (27, 0)][DBLP]
    MFCS, 1978, pp:536-551 [Conf]
  3. Manish Mehta, Rakesh Agrawal, Jorma Rissanen
    SLIQ: A Fast Scalable Classifier for Data Mining. [Citation Graph (25, 5)][DBLP]
    EDBT, 1996, pp:18-32 [Conf]
  4. Jorma Rissanen
    On Equivalences of Database Schemes. [Citation Graph (8, 11)][DBLP]
    PODS, 1982, pp:23-26 [Conf]
  5. Manish Mehta, Jorma Rissanen, Rakesh Agrawal
    MDL-Based Decision Tree Pruning. [Citation Graph (6, 0)][DBLP]
    KDD, 1995, pp:216-221 [Conf]
  6. Jorma Rissanen, Bostwick F. Wyman
    Duals of input/output maps. [Citation Graph (0, 0)][DBLP]
    Category Theory Applied to Computation and Control, 1974, pp:204-208 [Conf]
  7. Søren Forchhammer, Jorma Rissanen
    Coding with Partially Hidden Markov Models. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1995, pp:92-101 [Conf]
  8. Gergely Korodi, Jorma Rissanen, Ioan Tabus
    Lossless Data Compression Using Optimal Tree Machines. [Citation Graph (0, 0)][DBLP]
    DCC, 2005, pp:348-357 [Conf]
  9. Ioan Tabus, Gergely Korodi, Jorma Rissanen
    Text Compression Based on Variable-to-Fixed Codes for Markov Sources. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 2000, pp:133-142 [Conf]
  10. Ioan Tabus, Gergely Korodi, Jorma Rissanen
    DNA sequence compression using the normalized maximum likelihood model for discrete regression . [Citation Graph (0, 0)][DBLP]
    DCC, 2003, pp:253-262 [Conf]
  11. Jorma Rissanen
    Stochastic complexity in learning. [Citation Graph (0, 0)][DBLP]
    EuroCOLT, 1995, pp:196-210 [Conf]
  12. Ioan Tabus, Jorma Rissanen, Jaakko Astola
    Adaptive L-Predictors Based on Finite State Machine Context Selection. [Citation Graph (0, 0)][DBLP]
    ICIP (1), 1997, pp:401-404 [Conf]
  13. Adriana Vasilache, Ioan Tabus, Jorma Rissanen
    Algorithms for Constructing Min-Max Partitions of the Parameter Space for MDL Inference. [Citation Graph (0, 0)][DBLP]
    SSPR/SPR, 2004, pp:930-938 [Conf]
  14. Jorma Rissanen
    Hypothesis Selection and Testing by the MDL Principle. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1999, v:42, n:4, pp:260-269 [Journal]
  15. Jorma Rissanen
    Discussion of Paper 'Minimum Message Length and Kolmogorov Complexity' by C. S. Wallace and D. L. Dowe. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1999, v:42, n:4, pp:327-329 [Journal]
  16. Jorma Rissanen
    Rejoinder. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1999, v:42, n:4, pp:343-344 [Journal]
  17. Jorma Rissanen
    The Structure Function and Distinguishable Models of Data. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2006, v:49, n:6, pp:657-664 [Journal]
  18. Jorma Rissanen
    Bounds for Weight Balanced Trees. [Citation Graph (0, 0)][DBLP]
    IBM Journal of Research and Development, 1973, v:17, n:2, pp:101-105 [Journal]
  19. Jorma Rissanen
    Generalized Kraft Inequality and Arithmetic Coding. [Citation Graph (0, 0)][DBLP]
    IBM Journal of Research and Development, 1976, v:20, n:3, pp:198-203 [Journal]
  20. Jorma Rissanen, Glen G. Langdon Jr.
    Arithmetic Coding. [Citation Graph (0, 0)][DBLP]
    IBM Journal of Research and Development, 1979, v:23, n:2, pp:149-162 [Journal]
  21. Stephen Todd, Glen G. Langdon Jr., Jorma Rissanen
    Parameter Reduction and Context Selection for Compression of Gray-Scale Images. [Citation Graph (0, 0)][DBLP]
    IBM Journal of Research and Development, 1985, v:29, n:2, pp:188-193 [Journal]
  22. Jorma Rissanen
    Stochastic Complexity in Learning. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:55, n:1, pp:89-95 [Journal]
  23. Marcelo J. Weinberger, Jorma Rissanen, Ronald Arps
    Applications of universal context modeling to lossless compression of gray-scale images. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Image Processing, 1996, v:5, n:4, pp:575-586 [Journal]
  24. Andrew R. Barron, Jorma Rissanen, Bin Yu
    The Minimum Description Length Principle in Coding and Modeling. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:6, pp:2743-0 [Journal]
  25. Søren Forchhammer, Jorma Rissanen
    Partially hidden Markov models. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:4, pp:1253-1256 [Journal]
  26. Glen G. Langdon Jr., Jorma Rissanen
    A simple general binary source code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1982, v:28, n:5, pp:800-0 [Journal]
  27. Glen G. Langdon Jr., Jorma Rissanen
    Correction to 'A simple general binary source code' (Sep 82 800-803). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:5, pp:778-0 [Journal]
  28. Jorma Rissanen
    MDL Denoising. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2537-2543 [Journal]
  29. Jorma Rissanen
    Strong optimality of the normalized ML models as universal codes and information in data. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:5, pp:1712-1717 [Journal]
  30. Jorma Rissanen
    Complexity of simple nonlogarithmic loss functions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:2, pp:476-484 [Journal]
  31. Jorma Rissanen
    Tight lower bounds for optimum code length. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1982, v:28, n:2, pp:348-0 [Journal]
  32. Jorma Rissanen
    A universal data compression system. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:5, pp:656-663 [Journal]
  33. Jorma Rissanen
    Universal coding, information, prediction, and estimation. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:4, pp:629-636 [Journal]
  34. Jorma Rissanen
    Complexity of strings in the class of Markov sources. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1986, v:32, n:4, pp:526-532 [Journal]
  35. Jorma Rissanen
    Fisher information and stochastic complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:1, pp:40-47 [Journal]
  36. Jorma Rissanen
    Fast Universal Coding With Context Models. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:4, pp:1065-1071 [Journal]
  37. Jorma Rissanen, Glen G. Langdon Jr.
    Universal modeling and coding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1981, v:27, n:1, pp:12-22 [Journal]
  38. Jorma Rissanen, Terry P. Speed, Bin Yu
    Density estimation by stochastic complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:2, pp:315-323 [Journal]
  39. Jorma Rissanen, Marl Wax
    Measures of mutual and causal dependence between two time series. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1987, v:33, n:4, pp:598-0 [Journal]
  40. Ioan Tabus, Jorma Rissanen
    Asymptotics of greedy algorithms for variable-to-fixed length coding of Markov sources. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:7, pp:2022-2035 [Journal]
  41. Marcelo J. Weinberger, Jorma Rissanen, Meir Feder
    A universal finite memory source. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:3, pp:643-652 [Journal]
  42. Ioan Tabus, Jorma Rissanen, Jaakko Astola
    Classification and feature gene selection using the normalized maximum likelihood model for discrete regression. [Citation Graph (0, 0)][DBLP]
    Signal Processing, 2003, v:83, n:4, pp:713-727 [Journal]
  43. Teemu Roos, Petri Myllymäki, Jorma Rissanen
    MDL Denoising Revisited [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

Search in 0.026secs, Finished in 0.027secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002