Dagstuhl Seminar Proceedings: Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 2006

• Daniil Ryabko, Marcus Hutter:
  Sequence prediction for non-stationary processes.
  
• Zlatko Varbanov:
  Some Results for Identification for Sources and its Extension to Liar Models.
  
• Rudolf Ahlswede, Christian Deppe, Vladimir Lebedev:
  Non--binary error correcting codes with noiseless feedback, localized errors, or both.
  
• Andrei Asinowski:
  Suballowable sequences of permutations.
  
• Péter L. Erdös, Péter Ligeti, Péter Sziklai, David C. Torney:
  Subwords in reverse-complement order.
  
• Elena V. Konstantinova:
  Vertex reconstruction in Cayley graphs.
  
• Alberto Apostolico, Cinzia Pizzi:
  On the Monotonicity of the String Correction Factor for Words with Mismatches.
  
• Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein:
  06201 Executive Summary -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery.
  
• Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein:
  06201 Abstracts Collection -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery.
  
• Yury Lifshits:
  Solving Classical String Problems an Compressed Texts.
  
• Lee Jones, Konstantin A. Rybnikov:
  Local Minimax Learning of Approximately Polynomial Functions.
  

Last update Wed Feb 15 04:58:47 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page