الصفحة 12
الصفحة 12
List decoding of error-correcting codes : Winning thesis of the 2002 ACM doctoral dissertation competition
Presents some spectacular new results in the area of decoding algorithms for error-correcting codes. Specifically, it shows how the notion of “list-decoding” can be applied to recover from far more errors, for a wide variety of err- correcting codes, than achievable before. A brief bit of background : error-correcting codes are combinatorial str- tures that show how to represent (or “encode”) information so that it is - silient to a moderate number of errors. Speci?cally, an error-correcting code takes a short binary string, called the message, and shows how to transform it into a longer binary string, called the codeword, so that if a small number of bits of the codewordare ?ipped, the resulting string does not look like any other codeword. The maximum number of errorsthat the code is guaranteed to detect, denoted d, is a central parameter in its design. A basic property of such a code is that if the number of errors that occur is known to be smaller than d/2, the message is determined uniquely. This poses a computational problem, called the decoding problem : compute the message from a corrupted codeword, when the number of errors is less than d/2.
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 theory ; 20th Annual Conference on Learning theory, COLT 2007, San Diego, CA, USA, June 13-15, 2007, Proceedings
It covers unsupervised, semisupervised and active learning, statistical learning theory, inductive inference, regularized learning, kernel methods, SVM, online and reinforcement learning, learning algorithms and limitations on learning, dimensionality reduction, as well as open problems.
Learning Classifier Systems ; International Workshops, IWLCS 2003-2005, Revised Selected Papers
The work embodied in this volume was presented across three consecutive e- tions of the International Workshop on Learning Classi?er Systems that took place in Chicago (2003), Seattle (2004), and Washington (2005). The Genetic and Evolutionary Computation Conference, the main ACM SIGEvo conference, hosted these three editions.
Learning Classifier Systems ; 10th International Workshop, IWLCS 2006, Seattle, MA, USA, July 8, 2006 and 11th International Workshop, IWLCS 2007, London, UK, July 8, 2007, Revised Selected Papers
Constitutes the thoroughly refereed joint post-conference proceedings of two consecutive International Workshops on Learning Classifier Systems that took place in Seattle, WA, USA in July 2006, and in London, UK, in July 2007 - all hosted by the Genetic and Evolutionary Computation Conference, GECCO.The 14 revised full papers presented were carefully reviewed and selected from the workshop contributions. The papers are organized in topical sections on knowledge representation, analysis of the system, mechanisms, new directions, as well as applications.
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.
LATIN 2006 : Theoretical Informatics ; 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings
This book constitutes the refereed proceedings of the 7th International Symposium, Latin American Theoretical Informatics, LATIN 2006, held in March 2006. The 66 revised full papers presented together with seven invited papers were carefully reviewed and selected from 224 submissions. The papers presented are devoted to a broad range of topics in theoretical computer science with a focus on algorithmics and computations related to discrete mathematics as well as on cryptography, data compression and Web applications.
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.
Languages and Compilers for Parallel Computing ; 21th International Workshop, LCPC 2008, Edmonton, Canada, July 31 - August 2, 2008, Revised Selected Papers
This book constitutes the thoroughly refereed post-conference proceedings of the 21th International Workshop on Languages and Compilers for Parallel Computing, LCPC 2008, held in Edmonton, Canada, in July/August 2008.The 18 revised full papers and 6 revised short papers presented were carefully reviewed and selected from 35 submissions. The papers address all aspects of languages, compiler techniques, run-time environments, and compiler-related performance evaluation for parallel and high-performance computing and comprise
Knowledge Discovery and Emergent Complexity in Bioinformatics ; 1st International Workshop, KDECB 2006, Ghent, Belgium, May 10, 2006, Revised Selected Papers
Contains selected and revised papers of the International Symposium on Knowledge Discovery and Emergent Complexity in Bioinformatics (KDECB 2006), held at the University of Ghent, Belgium, May 10, 2006.
Job Scheduling Strategies for Parallel Processing ; Vol. 3834 : 11th International Workshop, JSSPP 2005, Cambridge, MA, USA, June 19, 2005, Revised Selected Papers
Constitutes the refereed postproceedings of the 11th International Workshop on Job Scheduling Strategies for Parallel Processing, 2005, held in conjunction with the 19th ACM International Conference on Supercomputing. This book covers a range of parallel architectures, from distributed grids, through clusters, to massively-parallel supercomputers.
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.
Computation Engineering : Applied Automata Theory and Logic
This book covers automata in depth, providing good intuitions along the way, and culminating with applications that are used every day in the field. In this respect, it is a departure from the conventional textbooks on complexity and computability, although these 'tradtional' aspects remain well represented.
Computation and Logic in the Real World ; 3rd Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings
This volume, Computation and Logic in the Real World, is the proceedings of the third in a series of conferences of CiE Computability in Europe, (CiE) is an informal network working on computability theory including its foundations, technical development, and applications. It performed with discrete or continuous data by all kinds of algorithms, programs, and machines. The sources of new ideas and methods include practical developments in areas such as neural networks, quantum computation, natural computation, molecular computation, computational learning.
Component-Based Software Development for Embedded Systems : An Overview of Current Research Trends
Embedded systems are ubiquitous. They appear in cell phones, microwave ovens, refrigerators, consumer electronics, cars, and jets. Some of these embedded s- tems are safety- or security-critical such as in medical equipment, nuclear plants, and X-by-wire control systems in naval, ground and aerospace transportation - hicles. With the continuing shift from hardware to software, embedded systems are increasingly dominated by embedded software. Embedded software is complex. Its engineering inherently involves a mul- disciplinary interplay with the physics of the embedding system or environment. Embedded software also comes in ever larger quantity and diversity. The next generation of premium automobiles will carry around one gigabyte of binary code. The proposed US DDX submarine is e?ectively a ?oating embedded so- ware system, comprising 30 billion lines of code written in over 100 programming languages. Embedded software is expensive. Cost estimates are quoted at around US$15– 30 per line (from commencement to shipping). In the defense realm, costs can range up to $100, while for highly critical applications, such as the Space Shuttle, the cost per line approximates $1,000. In view of the exponential increase in complexity, the projected costs of future embedded software are staggering.
Complexity Theory and Cryptology : An Introduction to Cryptocomplexity
Modern cryptology employs mathematically rigorous concepts and methods from complexity theory. Conversely, current research in complexity theory often is motivated by questions and problems arising in cryptology. This book takes account of this trend, and therefore its subject is what may be dubbed "cryptocomplexity,'' some sort of symbiosis of these two areas. This textbook is suitable for undergraduate and graduate students of computer science, mathematics, and engineering, and can be used for courses on complexity theory and cryptology, preferably by stressing their interrelation. Starting from scratch, it is an accessible introduction to cryptocomplexity and works its way to the frontiers of current research. It provides the necessary mathematical background, has numerous figures, exercises, and examples, and presents some central, up-to-date research topics and challenges. Due to its comprehensive bibliography and subject index, it is also a valuable source for researchers, teachers, and practitioners working in these fields.
Complexity Theory : Exploring the Limits of Efficient Algorithms
Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available resources. An understanding of these limits prevents the search for non-existing efficient algorithms. This textbook considers randomization as a key concept and emphasizes the interplay between theory and practice: New branches of complexity theory continue to arise in response to new algorithmic concepts, and its results - such as the theory of NP-completeness - have influenced the development of all areas of computer science. The topics selected have implications for concrete applications, and the significance of complexity theory for today's computer science is stressed throughout.
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.
