default search action
Dagstuhl Seminar Proceedings: Combinatorial and Algorithmic Foundations of Pattern and Association Discovery 2006
- Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein:
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05. - 19.05.2006. Dagstuhl Seminar Proceedings 06201, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 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 S. 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.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.