Published in: Dagstuhl Seminar Proceedings, Volume 9281, Search Methodologies (2009)
Rudolf Ahlswede, Ferdinando Cicalese, and Ugo Vaccaro. 09281 Abstracts Collection – Search Methodologies. In Search Methodologies. Dagstuhl Seminar Proceedings, Volume 9281, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{ahlswede_et_al:DagSemProc.09281.1, author = {Ahlswede, Rudolf and Cicalese, Ferdinando and Vaccaro, Ugo}, title = {{09281 Abstracts Collection – Search Methodologies}}, booktitle = {Search Methodologies}, pages = {1--15}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9281}, editor = {Rudolf Ahlswede and Ferdinando Cicalese and Ugo Vaccaro}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09281.1}, URN = {urn:nbn:de:0030-drops-22457}, doi = {10.4230/DagSemProc.09281.1}, annote = {Keywords: Search algorithms, group testing, fault-tolerance, identification, decision tree, multi-access communication} }
Published in: Dagstuhl Seminar Proceedings, Volume 9281, Search Methodologies (2009)
Ely Porat and Amir Rotschild. Explicit Non-Adaptive Combinatorial Group Testing Schemes. In Search Methodologies. Dagstuhl Seminar Proceedings, Volume 9281, pp. 1-13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{porat_et_al:DagSemProc.09281.2, author = {Porat, Ely and Rotschild, Amir}, title = {{Explicit Non-Adaptive Combinatorial Group Testing Schemes}}, booktitle = {Search Methodologies}, pages = {1--13}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9281}, editor = {Rudolf Ahlswede and Ferdinando Cicalese and Ugo Vaccaro}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09281.2}, URN = {urn:nbn:de:0030-drops-22414}, doi = {10.4230/DagSemProc.09281.2}, annote = {Keywords: Prime Numbers, Group Testing, Streaming, Pattern Matching} }
Published in: Dagstuhl Seminar Proceedings, Volume 9281, Search Methodologies (2009)
Charles J. Colbourn and Daniel W. McClary. Locating and Detecting Arrays for Interaction Faults. In Search Methodologies. Dagstuhl Seminar Proceedings, Volume 9281, pp. 1-34, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{colbourn_et_al:DagSemProc.09281.3, author = {Colbourn, Charles J. and McClary, Daniel W.}, title = {{Locating and Detecting Arrays for Interaction Faults}}, booktitle = {Search Methodologies}, pages = {1--34}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9281}, editor = {Rudolf Ahlswede and Ferdinando Cicalese and Ugo Vaccaro}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09281.3}, URN = {urn:nbn:de:0030-drops-22405}, doi = {10.4230/DagSemProc.09281.3}, annote = {Keywords: Covering array, Orthogonal array, Factorial design, Cover-free family, Disjunct matrix, Locating array, Detecting array} }
Published in: Dagstuhl Seminar Proceedings, Volume 9281, Search Methodologies (2009)
Pawel Gawrychowski and Travis Gagie. Minimax Trees in Linear Time with Applications. In Search Methodologies. Dagstuhl Seminar Proceedings, Volume 9281, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{gawrychowski_et_al:DagSemProc.09281.4, author = {Gawrychowski, Pawel and Gagie, Travis}, title = {{Minimax Trees in Linear Time with Applications}}, booktitle = {Search Methodologies}, pages = {1--11}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9281}, editor = {Rudolf Ahlswede and Ferdinando Cicalese and Ugo Vaccaro}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09281.4}, URN = {urn:nbn:de:0030-drops-22421}, doi = {10.4230/DagSemProc.09281.4}, annote = {Keywords: Data structures, data compression, prefix-free coding} }
Published in: Dagstuhl Seminar Proceedings, Volume 9281, Search Methodologies (2009)
Raphael Clifford, Klim Efremo, Ely Porat, and Amir Rotschild. Pattern matching with don't cares and few errors. In Search Methodologies. Dagstuhl Seminar Proceedings, Volume 9281, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{clifford_et_al:DagSemProc.09281.5, author = {Clifford, Raphael and Efremo, Klim and Porat, Ely and Rotschild, Amir}, title = {{Pattern matching with don't cares and few errors}}, booktitle = {Search Methodologies}, pages = {1--19}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9281}, editor = {Rudolf Ahlswede and Ferdinando Cicalese and Ugo Vaccaro}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09281.5}, URN = {urn:nbn:de:0030-drops-22442}, doi = {10.4230/DagSemProc.09281.5}, annote = {Keywords: Prime Numbers, Group Testing, Streaming, Pattern Matching} }
Published in: Dagstuhl Seminar Proceedings, Volume 9281, Search Methodologies (2009)
Gábor Wiener. Rounds in Combinatorial Search. In Search Methodologies. Dagstuhl Seminar Proceedings, Volume 9281, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{wiener:DagSemProc.09281.6, author = {Wiener, G\'{a}bor}, title = {{Rounds in Combinatorial Search}}, booktitle = {Search Methodologies}, pages = {1--5}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9281}, editor = {Rudolf Ahlswede and Ferdinando Cicalese and Ugo Vaccaro}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09281.6}, URN = {urn:nbn:de:0030-drops-22399}, doi = {10.4230/DagSemProc.09281.6}, annote = {Keywords: Search, group testing, adaptiveness, hypergraph, trace} }
Published in: Dagstuhl Seminar Proceedings, Volume 9281, Search Methodologies (2009)
Kingo Kobayashi. Some Aspects of Finite State Channel related to Hidden Markov Process. In Search Methodologies. Dagstuhl Seminar Proceedings, Volume 9281, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{kobayashi:DagSemProc.09281.7, author = {Kobayashi, Kingo}, title = {{Some Aspects of Finite State Channel related to Hidden Markov Process}}, booktitle = {Search Methodologies}, pages = {1--16}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9281}, editor = {Rudolf Ahlswede and Ferdinando Cicalese and Ugo Vaccaro}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09281.7}, URN = {urn:nbn:de:0030-drops-22434}, doi = {10.4230/DagSemProc.09281.7}, annote = {Keywords: Finite state channel, Hidden Markov source, Gilbert-Elliot channel, Trapdoor Channel} }
Published in: Dagstuhl Seminar Proceedings, Volume 6201, Combinatorial and Algorithmic Foundations of Pattern and Association Discovery (2006)
Lee Jones and Konstantin Rybnikov. Local Minimax Learning of Approximately Polynomial Functions. In Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. Dagstuhl Seminar Proceedings, Volume 6201, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{jones_et_al:DagSemProc.06201.3, author = {Jones, Lee and Rybnikov, Konstantin}, title = {{Local Minimax Learning of Approximately Polynomial Functions}}, booktitle = {Combinatorial and Algorithmic Foundations of Pattern and Association Discovery}, pages = {1--12}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6201}, editor = {Rudolf Ahlswede and Alberto Apostolico and Vladimir I. Levenshtein}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06201.3}, URN = {urn:nbn:de:0030-drops-8912}, doi = {10.4230/DagSemProc.06201.3}, annote = {Keywords: Local learning, statistical learning, estimator, minimax, convex optimization, quantifier elimination, semialgebraic, ridge regression, polynomial} }
Published in: Dagstuhl Seminar Proceedings, Volume 6201, Combinatorial and Algorithmic Foundations of Pattern and Association Discovery (2006)
Yury Lifshits. Solving Classical String Problems an Compressed Texts. In Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. Dagstuhl Seminar Proceedings, Volume 6201, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{lifshits:DagSemProc.06201.7, author = {Lifshits, Yury}, title = {{Solving Classical String Problems an Compressed Texts}}, booktitle = {Combinatorial and Algorithmic Foundations of Pattern and Association Discovery}, pages = {1--10}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6201}, editor = {Rudolf Ahlswede and Alberto Apostolico and Vladimir I. Levenshtein}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06201.7}, URN = {urn:nbn:de:0030-drops-7984}, doi = {10.4230/DagSemProc.06201.7}, annote = {Keywords: Pattern matching, Compressed text} }
Published in: Dagstuhl Seminar Proceedings, Volume 6201, Combinatorial and Algorithmic Foundations of Pattern and Association Discovery (2006)
Rudolf Ahlswede, Alberto Apostolico, and Vladimir I. Levenshtein. 06201 Abstracts Collection – Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. In Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. Dagstuhl Seminar Proceedings, Volume 6201, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{ahlswede_et_al:DagSemProc.06201.1, author = {Ahlswede, Rudolf and Apostolico, Alberto and Levenshtein, Vladimir I.}, title = {{06201 Abstracts Collection – Combinatorial and Algorithmic Foundations of Pattern and Association Discovery}}, booktitle = {Combinatorial and Algorithmic Foundations of Pattern and Association Discovery}, pages = {1--15}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6201}, editor = {Rudolf Ahlswede and Alberto Apostolico and Vladimir I. Levenshtein}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06201.1}, URN = {urn:nbn:de:0030-drops-7873}, doi = {10.4230/DagSemProc.06201.1}, annote = {Keywords: Data compression, pattern matching, pattern discovery, search, sorting, molecular biology, reconstruction, genome rearrangements} }
Published in: Dagstuhl Seminar Proceedings, Volume 6201, Combinatorial and Algorithmic Foundations of Pattern and Association Discovery (2006)
Rudolf Ahlswede, Alberto Apostolico, and Vladimir I. Levenshtein. 06201 Executive Summary – Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. In Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. Dagstuhl Seminar Proceedings, Volume 6201, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{ahlswede_et_al:DagSemProc.06201.2, author = {Ahlswede, Rudolf and Apostolico, Alberto and Levenshtein, Vladimir I.}, title = {{06201 Executive Summary – Combinatorial and Algorithmic Foundations of Pattern and Association Discovery}}, booktitle = {Combinatorial and Algorithmic Foundations of Pattern and Association Discovery}, pages = {1--2}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6201}, editor = {Rudolf Ahlswede and Alberto Apostolico and Vladimir I. Levenshtein}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06201.2}, URN = {urn:nbn:de:0030-drops-7926}, doi = {10.4230/DagSemProc.06201.2}, annote = {Keywords: Data compression, pattern matching, pattern discovery, search, sorting, molecular biology, reconstruction, genome rearrangements} }
Published in: Dagstuhl Seminar Proceedings, Volume 6201, Combinatorial and Algorithmic Foundations of Pattern and Association Discovery (2006)
Rudolf Ahlswede, Christian Deppe, and Vladimir Lebedev. Non--binary error correcting codes with noiseless feedback, localized errors, or both. In Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. Dagstuhl Seminar Proceedings, Volume 6201, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{ahlswede_et_al:DagSemProc.06201.4, author = {Ahlswede, Rudolf and Deppe, Christian and Lebedev, Vladimir}, title = {{Non--binary error correcting codes with noiseless feedback, localized errors, or both}}, booktitle = {Combinatorial and Algorithmic Foundations of Pattern and Association Discovery}, pages = {1--4}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6201}, editor = {Rudolf Ahlswede and Alberto Apostolico and Vladimir I. Levenshtein}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06201.4}, URN = {urn:nbn:de:0030-drops-7849}, doi = {10.4230/DagSemProc.06201.4}, annote = {Keywords: Error-correcting codes, localized errors, feedback, variable length codes} }
Published in: Dagstuhl Seminar Proceedings, Volume 6201, Combinatorial and Algorithmic Foundations of Pattern and Association Discovery (2006)
Alberto Apostolico and Cinzia Pizzi. On the Monotonicity of the String Correction Factor for Words with Mismatches. In Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. Dagstuhl Seminar Proceedings, Volume 6201, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{apostolico_et_al:DagSemProc.06201.5, author = {Apostolico, Alberto and Pizzi, Cinzia}, title = {{On the Monotonicity of the String Correction Factor for Words with Mismatches}}, booktitle = {Combinatorial and Algorithmic Foundations of Pattern and Association Discovery}, pages = {1--9}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6201}, editor = {Rudolf Ahlswede and Alberto Apostolico and Vladimir I. Levenshtein}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06201.5}, URN = {urn:nbn:de:0030-drops-7899}, doi = {10.4230/DagSemProc.06201.5}, annote = {Keywords: Pattern discovery, Motif, Over-represented word, Monotone score, Correction Factor} }
Published in: Dagstuhl Seminar Proceedings, Volume 6201, Combinatorial and Algorithmic Foundations of Pattern and Association Discovery (2006)
Daniil Ryabko and Marcus Hutter. Sequence prediction for non-stationary processes. In Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. Dagstuhl Seminar Proceedings, Volume 6201, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{ryabko_et_al:DagSemProc.06201.6, author = {Ryabko, Daniil and Hutter, Marcus}, title = {{Sequence prediction for non-stationary processes}}, booktitle = {Combinatorial and Algorithmic Foundations of Pattern and Association Discovery}, pages = {1--12}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6201}, editor = {Rudolf Ahlswede and Alberto Apostolico and Vladimir I. Levenshtein}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06201.6}, URN = {urn:nbn:de:0030-drops-7900}, doi = {10.4230/DagSemProc.06201.6}, annote = {Keywords: Sequence prediction, probability forecasting, local absolute continuity} }
Published in: Dagstuhl Seminar Proceedings, Volume 6201, Combinatorial and Algorithmic Foundations of Pattern and Association Discovery (2006)
Zlatko Varbanov. Some Results for Identification for Sources and its Extension to Liar Models. In Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. Dagstuhl Seminar Proceedings, Volume 6201, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{varbanov:DagSemProc.06201.8, author = {Varbanov, Zlatko}, title = {{Some Results for Identification for Sources and its Extension to Liar Models}}, booktitle = {Combinatorial and Algorithmic Foundations of Pattern and Association Discovery}, pages = {1--4}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {6201}, editor = {Rudolf Ahlswede and Alberto Apostolico and Vladimir I. Levenshtein}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06201.8}, URN = {urn:nbn:de:0030-drops-7820}, doi = {10.4230/DagSemProc.06201.8}, annote = {Keywords: Identification for sources, lies, prefix code} }
Feedback for Dagstuhl Publishing