You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Algorithmic learning theory is mathematics about computer programs which learn from experience. This involves considerable interaction between various mathematical disciplines including theory of computation, statistics, and c- binatorics. There is also considerable interaction with the practical, empirical ?elds of machine and statistical learning in which a principal aim is to predict, from past data about phenomena, useful features of future data from the same phenomena. The papers in this volume cover a broad range of topics of current research in the ?eld of algorithmic learning theory. We have divided the 29 technical, contributed papers in this volume into eight categories (correspond...
Autonomy and adaptivity are key aspects of truly intelligent artificial systems, dating from the first IAS conference in 1989. The goal of IAS-9 is to lay out scientific ideas and design principles for artificial systems. This work contains papers that cover both the applied and the theoretical aspects of intelligent autonomous systems.
This volume contains 3 invited papers, 15 regular papers, and 22 poster papers that were selected for presentation at the Third International Conference on Discovery Science (DS 2000), which was held 4-6 December 2000 in Kyoto. The Program Committee selected the contributed papers from 48 submissions. Three distinguished researchers accepted our invitation to present talks: J- frey D. Ullman (Stanford University), Joseph Y. Halpern (Cornell University), and Masami Hagiya (University of Tokyo). The Program Committee would like to thank all those who submitted papers for consideration and the invited speakers. I would like to thank the Program Committee members, the Local Arrangements Committe...
This book constitutes the refereed proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching, CPM 99, held in Warwick, UK in July 1999. The 21 revised papers presented were carefully reviewed and selected from 26 submissions. The papers address all current issues in combinatorial pattern matching dealing with a variety of classical objects like trees, regular expressions, graphs, point sets, and arrays as well as with DNA/RNA coding, WWW issues, information retrieval, data compression, and pattern recognition.
This book constitutes the refereed proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, CPM 2001, held in Jerusalem, Israel, in July 2001. The 21 revised papers presented together with one invited paper were carefully reviewed and selected from 35 submissions. The papers are devoted to current theoretical and algorithmic issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays as well as to advanced applications of CPM in areas such as the Internet, computational biology, multimedia systems, information retrieval, data compression, coding, computer vision, and pattern recognition.
This book presents the refereed proceedings of the 12th Annual International Computing and Combinatorics Conference, COCOON 2006, held in Taipei, Taiwan, August 2006. The book offers 52 revised full papers presented together with abstracts of 2 invited talks. The papers are organized in topical sections on computational economics, finance, and management, graph algorithms, computational complexity and computability, quantum computing, computational biology and medicine, computational geometry, graph theory, and more.
This book constitutes the refereed proceedings of the 43rd International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2017, held in Limerick, Ireland, in January 2017. The 34 papers presented in this volume were carefully reviewed and selected from 41 submissions. They were organized in topical sections named: foundations in computer science; semantics, specification and compositionality; theory of mobile and distributed systems; verification and automated system analysis; petri nets, games and relaxed data structures; graph theory and scheduling algorithms; quantum and matrix algorithms; planar and molecular graphs; coloring and vertex covers; algorithms for strings and formal languages; data, information and knowledge engineering; and software engineering: methods, tools, applications.
Focusing on data mining, this work is a joint effort from researchers in Japan, and includes a report on the forefront of data collection, user-centred mining and user interaction/reaction. It offers an overview of modern solutions with real-world applications, sharing hard-learned experiences.
None