Algorithms and Theory of Computation Handbook, Second Edition: General Concepts and Techniques provides an up-to-date compendium of fundamental computer science topics and techniques.
The tradition of a publication based on the Gathering for Gardner continues with this new carefully selected and edited collection in which Martin Gardner and friends inspire and entertain.
Ever since Lorensen and Cline published their paper on the Marching Cubes algorithm, isosurfaces have been a standard technique for the visualization of 3D volumetric data.
Emphasizes the Basic Principles of Computational Arithmetic and Computational Structure DesignTaking an interdisciplinary approach to the nanoscale generation of computer devices and systems, Computer Arithmetics for Nanoelectronics develops a consensus between computational properties provided by data structures and phenomenological properties of nano and molecular technology.
The integration and convergence of state-of-the-art technologies in the grid have enabled more flexible, automatic, and complex grid services to fulfill industrial and commercial needs, from the LHC at CERN to meteorological forecasting systems.
Algorithms that control the computational processes relating sensors and actuators are indispensable for robot navigation and the perception of the world in which they move.
Iterative algorithms often rely on approximate evaluation techniques, which may include statistical estimation, computer simulation or functional approximation.
A Fruitful Field for Researching Data Mining Methodology and for Solving Real-Life ProblemsContrast Data Mining: Concepts, Algorithms, and Applications collects recent results from this specialized area of data mining that have previously been scattered in the literature, making them more accessible to researchers and developers in data mining and
Research and development in the pioneering field of quantum computing involve just about every facet of science and engineering, including the significant areas of mathematics and physics.
The design of approximation algorithms for spanning tree problems has become an exciting and important area of theoretical computer science and also plays a significant role in emerging fields such as biological sequence alignments and evolutionary tree construction.
The availability of cheaper, faster, and more reliable electronic components has stimulated important advances in computing and communication technologies.
Emphasizing the search for patterns within and between biological sequences, trees, and graphs, Combinatorial Pattern Matching Algorithms in Computational Biology Using Perl and R shows how combinatorial pattern matching algorithms can solve computational biology problems that arise in the analysis of genomic, transcriptomic, proteomic, metabolomic
The ability of parallel computing to process large data sets and handle time-consuming operations has resulted in unprecedented advances in biological and scientific computing, modeling, and simulations.
Of considerable importance to numerical analysts, this text contains the proceedings of the 18th Dundee Biennial Conference on Numerical Analysis, featuring eminent analysts and current topics.
Hex Strategy is the first book to offer a comprehensive look at the game of Hex, from its history and mathematical underpinnings to discussions of advanced playing techniques.
This book provides a systematic approach for the algorithmic formulation and implementation of mathematical operations in computer algebra programming languages.
The mystique of biologically inspired (or bioinspired) paradigms is their ability to describe and solve complex relationships from intrinsically very simple initial conditions and with little or no knowledge of the search space.
Algorithm engineering allows computer engineers to produce a computational machine that will execute an algorithm as efficiently and cost-effectively as possible given a set of constraints, such as minimal performance or the availability of technology.
Integer Programming: Theory and Practice contains refereed articles that explore both theoretical aspects of integer programming as well as major applications.
Written by authors at the forefront of modern algorithms research, Delaunay Mesh Generation demonstrates the power and versatility of Delaunay meshers in tackling complex geometric domains ranging from polyhedra with internal boundaries to piecewise smooth surfaces.
From specialists in the field, you will learn about interesting connections and recent developments in the field of graph theory by looking in particular at Cartesian products-arguably the most important of the four standard graph products.
Explores the Impact of the Analysis of Algorithms on Many Areas within and beyond Computer ScienceA flexible, interactive teaching format enhanced by a large selection of examples and exercisesDeveloped from the author's own graduate-level course, Methods in Algorithmic Analysis presents numerous theories, techniques, and methods used for analyzing algorithms.
A new and refreshingly different approach to presenting the foundations of statistical algorithms, Foundations of Statistical Algorithms: With References to R Packages reviews the historical development of basic algorithms to illuminate the evolution of today's more powerful statistical algorithms.
Full of practical examples, Introduction to Scheduling presents the basic concepts and methods, fundamental results, and recent developments of scheduling theory.
With the advent of data-intensive applications, the elimination of redundancy in disseminated information has become a serious challenge for researchers who are on the lookout for evolving metaheuristic algorithms which can explore and exploit the information feature space to derive the optimal settings for specific applications.
With the advent of data-intensive applications, the elimination of redundancy in disseminated information has become a serious challenge for researchers who are on the lookout for evolving metaheuristic algorithms which can explore and exploit the information feature space to derive the optimal settings for specific applications.
Die Simulation des menschlichen Herzens, die Vorhersage des morgigen Wetters, die Optimierung der Aerodynamik eines Segelboots, die Suche nach der idealen Garzeit für einen Hamburger: Bei der Lösung dieser Probleme können Kardiologen, Meteorologen, Sportler und Ingenieure auf mathematische Hilfe zählen.
Die Simulation des menschlichen Herzens, die Vorhersage des morgigen Wetters, die Optimierung der Aerodynamik eines Segelboots, die Suche nach der idealen Garzeit für einen Hamburger: Bei der Lösung dieser Probleme können Kardiologen, Meteorologen, Sportler und Ingenieure auf mathematische Hilfe zählen.
While Java texts are plentiful, it's difficult to find one that takes a real-world approach, and encourages novice programmers to build on their Java skills through practical exercise.
Cryptography, the science of encoding and decoding information, allows people to do online banking, online trading, and make online purchases, without worrying that their personal information is being compromised.
Although the particle swarm optimisation (PSO) algorithm requires relatively few parameters and is computationally simple and easy to implement, it is not a globally convergent algorithm.
Get an In-Depth Understanding of Graph Drawing Techniques, Algorithms, Software, and ApplicationsThe Handbook of Graph Drawing and Visualization provides a broad, up-to-date survey of the field of graph drawing.