TENTATIVE SCHEDLE for Contributed Papers
Monday, June 2
Redundancy of universal coding, Komogorov complexity and Hausdorff dimension
Hayato Takahashi, takahasi@ism.ac.jp
A new universal two part code for estimation of string Kolmogorov complexity and algorithmic minimum sufficient statistic
Scott Evans, evans@crd.ge.com
Finite memory universal coding of individual binary sequences
Eado Meron, eadomezo@netvision.net.il
Complexity preserving functions
Jan Lemeire, jlemeire@info.vub.ac.be
Some analysis of a predictive lossless coder for audio signals
Peng Zhao, pengzhao@stat.berkeley.edu
Tuesday, June 3
Message length estimators, probabilistic sampling and optimal prediction
Ian Davidson, davidson@cs.albany.edu
Data compression and learning
John Langford, jcl@cs.cmu.edu
Classification or regression trees
Clayton Scott, cscott@rice.edu
Learnability beyond AC^0
Adam Klivans, klivans@eecs.harvard.edu
Wednesday, June 4
Subjective randomness and cognitive complexity
Tom Griffiths, gruffydd@psych.stanford.edu
Minimum description length cognitive modeling
Yong Su, su.85@osu.edu
Using polynomial local search and Kolmogorov complexities to better understand evolutionary algorithms
Natalio Krasnogor, Natalio.krasnogor@nottingham.ac.uk
Condensation of boolean formulas
Takashi Horiyama, horiyama@i.kyoto-u.ac.jp
Complexity and vulnerability analysis
Stephen Bush, bushsf@crd.ge.com