Combinatorial and Algorithmic Foundations of Pattern and Association Discovery Dagstuhl Seminar

نویسندگان

  • Rudolf Ahlswede
  • Alberto Apostolico
  • Vladimir I. Levenshtein
  • Andrei Asinowski
چکیده

From 15.05.06 to 20.05.06, the Dagstuhl Seminar 06201 Combinatorial and Algorithmic Foundations of Pattern and Association Discovery was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The rst section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithmic Methods for Distributed Cooperative Systems Dagstuhl Seminar

From 06.09.09 to 11.09.09 the Dagstuhl Seminar 09371 Algorithmic Methods for Distributed Cooperative Systems was held in Schloss Dagstuhl Leibniz Center for Informatics. The purpose of this workshop was to bring together researchers from di erent disciplines whose central interest is in both algorithmic foundations and application scenarios of distributed cooperative systems. During the seminar...

متن کامل

Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory

This is list of combinatorial games problems collected at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory, organized by the authors. For more unsolved problems in combinatorial games see the list of unsolved problems [4] and its successors in Games of No Chance [5] and in More Games of No Chance [7], hereafter referred to as MGONC. An on-line version can be found on David Wol...

متن کامل

Subwords in reverse-complement order

We examine finite words over an alphabet Γ = {

متن کامل

Foundations of distributed data management (Dagstuhl Seminar 11421)

Forensic Computing (Dagstuhl Seminar 11401) Felix C. Freiling, Dirk Heckmann, Radim Polcák, and Joachim Posegga . . . . . . . . . . 1 Computing with Infinite Data: Topological and Logical Foundations (Dagstuhl Seminar 11411) Ulrich Berger, Vasco Brattka, Victor Selivanov, Dieter Spreen, and Hideki Tsuiki 14 Foundations of distributed data management (Dagstuhl Seminar 11421) Serge Abiteboul, Ali...

متن کامل

Computational Foundations of Social Choice Dagstuhl Seminar

From March 7 to March 12, 2010, the Dagstuhl Seminar 10101 Computational Foundations of Social Choice was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar are put together in this paper. The rst section desc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006