الصفحة 4
الصفحة 4
Combinatorial optimization and applications ; 2nd International Conference, COCOA 2008, St. John’s, NL, Canada, August 21-24, 2008. Proceedings
This book constitutes the refereed proceedings of the Second International Conference on Combinatorial Optimization and Applications, COCOA 2008, held in St. John's, Canada, in August 2008.
Combinatorial Image Analysis ; 12th International Workshop, IWCIA 2008, Buffalo, NY, USA, April 7-9, 2008. Proceedings
This volume contains the proceedings of the 12th International Workshop on Combinatorial Image Analysis. Coverage includes digital geometry, curves and surfaces, applications of computational geometry, as well as medical imaging and biometrics.
Mathematical Foundations of Computer Science 2008 ; 33rd International Symposium, MFCS 2008, Toru´n, Poland, August 25-29, 2008. Proceedings
Constitutes the refereed proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2008, held in Torun, Poland, in August 2008.The 45 revised full papers presented together with 5 invited lectures were carefully reviewed and selected from 119 submissions. All current aspects in theoretical computer science and its mathematical foundations are addressed, ranging from algorithmic game theory, algorithms and data structures, artificial intelligence, automata and formal languages, bioinformatics, complexity, concurrency and petrinets, cryptography and security, logic and formal specifications, models of computations, parallel and distributed computing, semantics and verification.
Machine Learning and Knowledge Discovery in Databases ; European Conference, ECML PKDD 2008, Antwerp, Belgium, September 15-19, 2008, Proceedings, Part II
Constitutes the refereed proceedings of the joint conference on Machine Learning and Knowledge Discovery in Databases: ECML PKDD 2008, held in Antwerp, Belgium, in September 2008.The 100 papers presented in two volumes, together with 5 invited talks, were carefully reviewed and selected from 521 submissions. In addition to the regular papers the volume contains 14 abstracts of papers appearing in full version in the Machine Learning Journal and the Knowledge Discovery and Databases Journal of Springer.
Machine Learning and Knowledge Discovery in Databases ; European Conference, ECML PKDD 2008, Antwerp, Belgium, September 15-19, 2008, Proceedings, Part I
Constitutes the refereed proceedings of the joint conference on Machine Learning and Knowledge Discovery in Databases: ECML PKDD 2008, held in Antwerp, Belgium, in September 2008.The 100 papers presented in two volumes, together with 5 invited talks, were carefully reviewed and selected from 521 submissions. In addition to the regular papers the volume contains 14 abstracts of papers appearing in full version in the Machine Learning Journal and the Knowledge Discovery and Databases Journal of Springer.
Logic, language, information and computation ; 15th International Workshop, WoLLIC 2008 Edinburgh, UK, July 1-4, 2008 Proceedings
The papers cover all pertinent subjects in computer science with particular interest in cross-disciplinary topics. Typical areas of interest are: foundations of computing and programming; novel computation models and paradigms; broad notions of proof and belief; formal methods in software and hardware development; logical approach to natural language and reasoning; logics of programs, actions and resources; foundational aspects of information organization, search, flow, sharing, and protection.
Logic and Theory of Algorithms ; 4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 15-20, 2008 Proceedings
Constitutes the refereed proceedings of the 4th International Conference on Computability in Europe, CiE 2008, held in Athens, Greece, in June 2008.The 36 revised full papers presented together with 25 invited tutorials and lectures were carefully reviewed and selected from 108 submissions. Among them are papers of 6 special sessions entitled algorithms in the history of mathematics, formalising mathematics and extracting algorithms from proofs, higher-type recursion and applications, algorithmic game theory, quantum algorithms and complexity, and biology and computation.
Life System Modeling and Simulation; International Conference on Life System Modeling, and Simulation, LSMS 2007, Shanghai, China, September 14-17, 2007. Proceedings
The International Conference on Life System Modeling and Simulation (LSMS) was formed to bring together international researchers and practitioners in the field of life system modeling and simulation as well as life system-inspired theory and methodology. The arrival of the 21st century has been marked by a resurgence of research interest both in arriving at a systems-level und- standing of biology and in applying such knowledge in complex real-world appli- tions. Consequently, computational methods and intelligence in systems, biology, as well as bio-inspired computational intelligence, have emerged as key drivers for new computational methods. For this reason papers dealing with theory, techniques and real-world applications relating to these two themes were especially solicited.
Learning and Intelligent Optimization ; 2nd International Conference, LION 2007 II, Trento, Italy, December 8-12, 2007. Selected Papers
The papers cover current issues of machine learning, artificial intelligence, mathematical programming and algorithms for hard optimization problems and are organized in topical sections on improving optimization through learning, variable neighborhood search, insect colony optimization, applications, new paradigms, cliques, stochastic optimization, combinatorial optimization, fitness and landscapes, and particle swarm optimization.
LATIN 2008 : Theoretical Informatics ; 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008. Proceedings
The Latin American Theoretical INformatics Symposium (LATIN) is becoming a traditional and high-quality conference on the Theory of Computing. Previous conferences havebeen organized twiceinBrazil: SaoPaulo (1992) and Campinas (1998); twice in Chile: Valpara so (1995) and Valdivia (2006); once in Uruguay: Punta del Este (2000); once in Mexico: Cancun (2002); and once in Argentina: Buenos Aires (2004). This volume contains the proceedings of the 8th Latin American Theore- cal INformatics Symposium (LATIN 2008), which was held in Buzio s, Rio de Janeiro, Brazil, April 7 11, 2008.
Large-Scale Scientific Computing ; 6th International Conference, LSSC 2007, Sozopol, Bulgaria, June 5-9, 2007. Revised Papers
The 6th International Conference on Large-Scale Scienti?c Computations (LSSC 2007) was held in Sozopol, Bulgaria, June 5–9, 2007. The conference was organized by the Institute for Parallel Processing at the Bulgarian Academy of Sciences in cooperation with SIAM (Society for Industrial and Applied Ma- ematics). Partial support was also provided from project BIS-21++ funded by the European Commission in FP6 INCO via grant 016639/2005. The conference was devoted to the 60th anniversary of Richard E. Professor Ewing is internati- ally well known with his contributions in applied mathematics, mathematical modeling, and large-scale scientific computations.
Job Scheduling Strategies for Parallel Processing ; 13th International Workshop, JSSPP 2007, Seattle, WA, USA, June 17, 2007. Revised Papers
Constitutes the thoroughly refereed post-workshop proceedings of the 13th International Workshop on Job Scheduling Strategies for Parallel Processing, JSSPP 2007, held in Seattle, WA, USA, in June 2007, in conjunction with the 21st ACM International Conference on Supercomputing, ICS 2007.The 10 revised full research papers presented went through the process of strict reviewing and subsequent improvement. The papers cover all current issues of job scheduling strategies for parallel processing from the supercomputer-centric viewpoint but also address many nontraditional high-performance computing and parallel environments that cannot or need not access a traditional supercomputer.
Job Scheduling Strategies for Parallel Processing ; 12th International Workshop, JSSPP 2006, Saint-Malo, France, June 26, 2006, Revised Selected Papers
Constitutes the thoroughly refereed post-proceedings of the 12th International Workshop on Job Scheduling Strategies for Parallel Processing, JSSPP 2006, held in Saint-Malo, France in June 2006 in conjunction with the Joint International Conference on Measurement and Modeling of Computer Systems SIGMETRICS/Performance 2006.
Complexity of Constraints : An Overview of Current Research Themes
This state-of-the-art survey contains the papers that were invited by the organizers after conclusion of an International Dagstuhl-Seminar on Complexity of Constraints, held in Dagstuhl Castle, Germany, in October 2006.
Complex Motion ; 1st International Workshop, IWCM 2004, Günzburg, Germany, October 12-14, 2004, Revised Papers
The world we live in is a dynamic one: we explore it by moving through it, and many of the objects which we are interested in are also moving. Trafic, for instance, is an example of a domain where detecting and processing visual motion is of vital interest, both in a metaphoric as well as in a purely literal sense. Visual communication is another important example of an area of science which is dominated by the need to measure, understand, and represent visual motion in an eficient way. Visual motion is a subject of research which forces the investigator to deal with complexity; complexity in the sense of facing efiects of motion in a very large diversity of forms, starting from analyzing simple motion in a changing envir- ment (illumination, shadows, . . . ), under adverse observation conditions, such as bad signal-to-noiseratio (low illumination, small-scaleprocesses, low-dosex-ray, etc. ), covering also multiple motions of independent objects, occlusions, and - ing as far as dealing with objects which are complex in themselves (articulated objects such as bodies of living beings). The spectrum of problems includes, but does not end at, objects which are not ‘bodies’ at all, e. g. , when anal- ing fiuid motion, cloud motion, and so on. Analyzing the motion of a crowd in a shopping mall or in an airport is a further example that implies the need to struggle against the problems induced by complexity.
Comparative genomics ; RECOMB 2007, International Workshop, RECOMB-CG 2007, San Diego, CA, USA, September 16-18, 2007, Proceedings
This book provides an evolutionary conceptual framework for comparative genomics, with the ultimate objective of understanding the loss and gain of genes during evolution, the interactions among gene products, and the relationship between genotype, phenotype and the environment. The many examples in the book have been carefully chosen from primary research literature based on two criteria: their biological insight and their pedagogical merit. The phylogeny-based comparative methods, involving both continuous and discrete variables, often represent a stumbling block for many students entering the field of comparative genomics. They are numerically illustrated and explained in great detail.
Cellular automata ; 8th International conference on cellular automata for research and industry, ACRI 2008, Yokohama, Japan, September 23-26, 2008. Proceedings
This book constitutes the refereed proceedings of the 8th International Conference on Cellular Automata for Research and Industry, ACRI 2008, held in Yokohama, Japan, in September 2008.
Bio-inspired computing and communication ; 1st Workshop on Bio-inspired design of networks, BIOWIRE 2007 Cambridge, UK, April 2-5, 2007 Revised Selected Papers
The book constitutes the thoroughly refereed post-workshop proceedings of the First Workshop on Bio-Inspired Design of Networks, BIOWIRE 2007, held in Cambridge, UK, in April 2007.
Bioinformatics : Problem Solving Paradigms
This book highlights basic paradigms of problem analysis and algorithm design in the context of core bioinformatics problems. Mathematically demanding themes are put across to the reader by properly chosen representations with the aid of lots of illustrations.
Beyond the Worst-Case Analysis of Algorithms
There are no silver bullets in algorithm design, and no single algorithmic idea is powerful and flexible enough to solve every computational problem. Nor are there silver bullets in algorithm analysis, as the most enlightening method for analyzing an algorithm often depends on the problem and the application. However, typical algorithms courses rely almost entirely on a single analysis framework, that of worst-case analysis, wherein an algorithm is assessed by its worst performance on any input of a given size. The purpose of this book is to popularize several alternatives to worst-case analysis and their most notable algorithmic applications, from clustering to linear programming to neural network training. Forty leading researchers have contributed introductions to different facets of this field, emphasizing the most important models and results, many of which can be taught in lectures to beginning graduate students in theoretical computer science and machine learning.
