You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
In this first-ever graduate textbook on the algorithmic aspects of real algebraic geometry, the main ideas and techniques presented form a coherent and rich body of knowledge, linked to many areas of mathematics and computing. Mathematicians already aware of real algebraic geometry will find relevant information about the algorithmic aspects. Researchers in computer science and engineering will find the required mathematical background. This self-contained book is accessible to graduate and undergraduate students.
This 2005 book deals with interest topics in Discrete and Algorithmic aspects of Geometry.
"Based on a lecture series given by the authors at a satellite meeting of the 2006 International Congress of Mathematicians and on many articles written by them and their collaborators, this volume provides a comprehensive up-to-date survey of several core areas of combinatorial geometry. It describes the beginnings of the subject, going back to the nineteenth century (if not to Euclid), and explains why counting incidences and estimating the combinatorial complexity of various arrangements of geometric objects became the theoretical backbone of computational geometry in the 1980s and 1990s. The combinatorial techniques outlined in this book have found applications in many areas of computer ...
This book constitutes the refereed proceedings of the 19th Annual International Conference on Research in Computational Molecular Biology, RECOMB 2015, held in Warsaw, Poland, in April 2015. The 36 extended abstracts were carefully reviewed and selected from 170 submissions. They report on original research in all areas of computational molecular biology and bioinformatics.
Cyber-physical systems (CPSs) combine cyber capabilities, such as computation or communication, with physical capabilities, such as motion or other physical processes. Cars, aircraft, and robots are prime examples, because they move physically in space in a way that is determined by discrete computerized control algorithms. Designing these algorithms is challenging due to their tight coupling with physical behavior, while it is vital that these algorithms be correct because we rely on them for safety-critical tasks. This textbook teaches undergraduate students the core principles behind CPSs. It shows them how to develop models and controls; identify safety specifications and critical properties; reason rigorously about CPS models; leverage multi-dynamical systems compositionality to tame CPS complexity; identify required control constraints; verify CPS models of appropriate scale in logic; and develop an intuition for operational effects. The book is supported with homework exercises, lecture videos, and slides.
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.
This book constitutes the proceedings of the 24th International Workshop on Computer Algebra in Scientific Computing, CASC 2022, which took place in Gebze, Turkey, in August 2022. The 20 full papers included in this book were carefully reviewed and selected from 32 submissions. They focus on the theory of symbolic computation and its implementation in computer algebra systems as well as all other areas of scientific computing with regard to their benefit from or use of computer algebra methods and software.
This volume contains nineteen survey papers describing the state of current research in discrete and computational geometry as well as a set of open problems presented at the 2006 AMS-IMS-SIAM Summer Research Conference Discrete and Computational Geometry--Twenty Years Later, held in Snowbird, Utah, in June 2006. Topics surveyed include metric graph theory, lattice polytopes, the combinatorial complexity of unions of geometric objects, line and pseudoline arrangements, algorithmic semialgebraic geometry, persistent homology, unfolding polyhedra, pseudo-triangulations, nonlinear computational geometry, $k$-sets, and the computational complexity of convex bodies.