You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This book constitutes the refereed proceedings of the 12th International Conference on Algorithms and Computation, ISAAC 2001, held in Christchurch, New Zealand in December 2001. The 62 revised full papers presented together with three invited papers were carefully reviewed and selected from a total of 124 submissions. The papers are organized in topical sections on combinatorial generation and optimization, parallel and distributed algorithms, graph drawing and algorithms, computational geometry, computational complexity and cryptology, automata and formal languages, computational biology and string matching, and algorithms and data structures.
During its 30-year existence, the International Workshop on Graph-Theoretic Concepts in Computer Science has become a distinguished and high-quality computer science event. The workshop aims at uniting theory and practice by demonstrating how graph-theoretic concepts can successfully be applied to v- ious areas of computer science and by exposing new theories emerging from applications. In this way, WG provides a common ground for the exchange of information among people dealing with several graph problems and working in various disciplines. Thereby, the workshop contributes to forming an interdis- plinary research community. The original idea of the Workshop on Graph-Theoretic Concepts in C...
This book constitutes the thoroughly refereed post-proceedings of the 9th International Symposium on Graph Drawing, GD 2001, held in Vienna, Austria, in September 2001. The 32 revised full papers presented were carefully reviewed and selected from 66 paper submissions. Also included are a corrected version of a paper from the predecessor volume, short reports on the software systems exhibition, two papers of the special session on graph exchange formats, and a report on the annual graph drawing contests. The papers are organized in topical sections on hierarchical drawing, planarity, crossing theory, compaction, planar graphs, symmetries, interactive drawing, representations, aesthetics, 2D- and 3D-embeddings, data visualization, floor planning, and planar drawing.
This book brings together the research of a number of scholars in the field of knowledge creation and imparts a sense of order to the field. The chapters share three characteristics: they are all grounded in extensive qualitative and/or quantitative research; they all go beyond the mere description of the knowledge-creation process and offer both theoretical and strategic implications; they share a view of knowledge creation and knowledge transfer as delicate processes, necessitating particular forms of support from managers.
This book constitutes the thoroughly refereed post-proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2007, held in Dornburg, Germany, in June 2007. The 30 revised full papers presented together with one invited paper were carefully selected from 99 submissions. The papers feature original results on all aspects of graph-theoretic concepts in Computer Science, including structural graph theory, graph-based modeling, and graph-drawing.
This book constitutes the proceedings of the 16th International Conference on Discovery Science, DS 2013, held in Singapore in October 2013, and co-located with the International Conference on Algorithmic Learning Theory, ALT 2013. The 23 papers presented in this volume were carefully reviewed and selected from 52 submissions. They cover recent advances in the development and analysis of methods of automatic scientific knowledge discovery, machine learning, intelligent data analysis, and their application to knowledge discovery.
This book constitutes the refereed proceedings of the 4th International Conference on Theory and Applications of Models of Computation, TAMC 2007, held in Shanghai, China in May 2007. It addresses all major areas in computer science; mathematics, especially logic; and the physical sciences, particularly with regard to computation and computability theory. The papers particularly focus on algorithms, complexity and computability theory.
Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and Applications The Handbook of Graph Drawing and Visualization provides a broad, up-to-date survey of the field of graph drawing. It covers topological and geometric foundations, algorithms, software systems, and visualization applications in business, education, science, and engineering. Each chapter is self-contained and includes extensive references. The first several chapters of the book deal with fundamental topological and geometric concepts and techniques used in graph drawing, such as planarity testing and embedding, crossings and planarization, symmetric drawings, and proximity drawings. The following...
This book constitutes the refereed proceedings of the First International Workshop on Machine Learning and Data Mining in Pattern Recognition, MLDM'99, held in Leipzig, Germany in September 1999. The 15 revised full papers presented together with two invited contributions were carefully reviewed. The papers are organized in sections on neural networks applied to image processing and recognition, learning in image pre-processing and segmentation, image retrieval, classification and image interpretation, symbolic learning and neural networks in document processing, and data mining.
This book is a significant contribution to the subject of mining time-changing data streams and addresses the design of learning algorithms for this purpose. It introduces new contributions on several different aspects of the problem, identifying research opportunities and increasing the scope for applications. It also includes an in-depth study of stream mining and a theoretical analysis of proposed methods and algorithms. The first section is concerned with the use of an adaptive sliding window algorithm (ADWIN). Since this has rigorous performance guarantees, using it in place of counters or accumulators, it offers the possibility of extending such guarantees to learning and mining algori...