Bøger af Rüdiger Reischuk

This volume contains the papers presented at the 13th Annual Conference on Algorithmic Learning Theory (ALT 2002), which was held in Lub * eck (Germany) during November 24-26, 2002. The main objective of the conference was to p- vide an interdisciplinary forum discussing the theoretical foundations of machine learning as well as their relevance to practical applications. The conference was colocated with the Fifth International Conference on Discovery Science (DS 2002). The volume includes 26 technical contributions which were selected by the program committee from 49 submissions. It also contains the ALT 2002 invited talks presented by Susumu Hayashi (Kobe University, Japan) on "e;Mathematics Based on Learning"e;, by John Shawe-Taylor (Royal Holloway University of L- don, UK) on "e;On the Eigenspectrum of the Gram Matrix and Its Relationship to the Operator Eigenspectrum"e;, and by Ian H. Witten (University of Waikato, New Zealand) on "e;Learning Structure from Sequences, with Applications in a Digital Library"e; (joint invited talk with DS 2002). Furthermore, this volume - cludes abstracts of the invited talks for DS 2002 presented by Gerhard Widmer (Austrian Research Institute for Arti?cial Intelligence, Vienna) on "e;In Search of the Horowitz Factor: Interim Report on a Musical Discovery Project"e; and by Rudolf Kruse (University of Magdeburg, Germany) on "e;Data Mining with Graphical Models"e;. The complete versions of these papers are published in the DS 2002 proceedings (Lecture Notes in Arti?cial Intelligence, Vol. 2534). ALT has been awarding the E.

This volume is dedicated to the 15th Symposium on Fundamentals of Com- tation Theory FCT 2005, held in Lu ¿beck, Germany, on August 17-20, 2005. The FCT symposium was established in 1977 as a biennial event for - searchers interested in all aspects of theoretical computer science, in particular in algorithms, complexity, and formal and logical methods. The previous FCT conferences were held in the following places: Poznan ¿ (Poland, 1977),Wendisch- Rietz (Germany, 1979), Szeged (Hungary, 1981), Borgholm (Sweden, 1983), Cottbus(Germany,1985),Kazan(Russia,1987),Szeged(Hungary,1989),Gosen- Berlin (Germany, 1991), Szeged (Hungary, 1993), Dresden (Germany, 1995), Krak¿ ow (Poland, 1997), Iasi (Romania, 1999), Riga (Latvia, 2001) and Malmo ¿ (Sweden, 2003). The FCT conference seriesis coordinatedby a steering comm- tee. Its current members are B. Chlebus (Denver/Warsaw),Z. Esik (Szeged), M. Karpinski (Bonn), A. Lingas (Lund), M. Santha (Paris), E. Upfal (Providence) and I. Wegener (Dortmund). The call for papers for FCT 2005 sought contributions on original research in all aspects of theoretical computer science including design and analysis of algorithms, abstract data types, approximation algorithms, automata and formal languages, categorical and topological approaches, circuits, computational and structural complexity, circuit and proof theory, computational biology, com- tational geometry, computer systems theory, concurrency theory, cryptography, domain theory, distributed algorithms and computation, molecular computation, quantumcomputation and information, granular computation, probabilistic c- putation, learning theory, rewriting, semantics, logic in computer science, spe- ?cation, transformation and veri?cation, and algebraic aspects of computer s- ence.