Algorithms and data structures

This book constitutes the refereed proceedings of the 18th International Joint Conference on Theoretical Computer Science-Frontier of Algorithmic Wisdom (IJTCS-FAW 2024), consisting of the 18th International Conference on Frontier of Algorithmic Wisdom (FAW) and the 5th International Joint Conference on Theoretical Computer Science (IJTCS), held in Hong Kong, SAR, China, during July 29-31, 2024.

This book constitutes the refereed proceedings of CVM 2024, the 12th International Conference on Computational Visual Media, held in Wellington, New Zealand, in April 2024.

This book constitutes the proceedings from the 38th Annual IFIP 11.

An accessible introduction to the fundamental algorithms used to run the world.

The beating heart of any product or service business is returning clients.

Monte Carlo Methods are among the most used, and useful, computational tools available today.

This book LNCS 15336 constitutes the refereed proceedings of the 13th International Conference on Health Information Science, HIS 2024, held in Hong Kong, China, during December 8-10, 2024.

The five-volume set CCIS 2133-2137 constitutes the refereed proceedings of the workshops held in conjunction with the Joint European Conference on Machine Learning and Knowledge Discovery in Databases, ECML PKDD 2023, which took place in Turin, Italy, during September 18-22, 2023.

This two-volume set volume constitutes the papers of ten workshops which were held in conjunction with the 22nd International Conference on Service-Oriented Computing, ICSOC 2024.

This proceedings constitutes selected papers from the Workshops KGMA, SemiBDMA, MADM, AIEDM and STBDM which were held in conjunction with APWeb-WAIM 2024 which took place in Jinhua, China, August 30-September 1, 2024.

This book presents a comprehensive review of key distributed graph algorithms for computer network applications, with a particular emphasis on practical implementation.

This easy-to-read textbook/reference presents a comprehensive introduction to databases, opening with a concise history of databases and of data as an organisational asset.

This comprehensive and self-contained textbook presents an accessible overview of the state of the art of multivariate algorithmics and complexity.

Mathematical algorithms are a fundamental component of Computer Aided Design and Manufacturing (CAD/CAM) systems.

Modern algorithmic techniques for summation, most of which were introduced in the 1990s, are developed here and carefully implemented in the computer algebra system Maple(TM).

Markov decision process (MDP) models are widely used for modeling sequential decision-making problems that arise in engineering, economics, computer science, and the social sciences.

Due to its inherent time-scale locality characteristics, the discrete wavelet transform (DWT) has received considerable attention in signal/image processing.

The presence of uncertainty in a system description has always been a critical issue in control.

Polyhedral and Algebraic Methods in Computational Geometry provides a thorough introduction into algorithmic geometry and its applications.

This textbook provides an engaging and motivational introduction to traditional topics in discrete mathematics, in a manner specifically designed to appeal to computer science students.

Despite the volume of research carried out into the design of database systems and the design of user interfaces, there is little cross-fertilization between the two areas.

Mechanical design includes an optimization process in which designers always consider objectives such as strength, deflection, weight, wear, corrosion, etc.

At first sight, finitely generated abelian groups and canonical forms of matrices appear to have little in common.

This unique text/reference reviews algorithms for the exact or approximate solution of shortest-path problems, with a specific focus on a class of algorithms called rubberband algorithms.

Number theory is a branch of mathematics which draws its vitality from a rich historical background.

Formal methods enable computer architecture and software design to be mathematically proved correct before they are implemented.

Models of Sharing Graphs presents a sound mathematical basis for reasoning about models of computation involving shared resources, including graph rewriting systems, denotational semantics and concurrency theory.

Advances in Soft Computing contains the most recent developments in the field of soft computing in engineering design and manufacture.

Randomized Algorithms discusses two problems of fine pedigree: counting and generation, both of which are of fundamental importance to discrete mathematics and probability.

This book updates the thesis I produced for my PhD at the Department of Artificial Intelligence of the University of Edinburgh, correcting errors, and improving some of the formatting and readability.

This book discusses the use of the real numbers in theorem proving.

The third evolutionary I adaptive computing conference organised by the Plymouth Engineering Design Centre (PEDC) at the University of Plymouth again explores the utility of various adaptive search algorithms and complementary computational intelligence techniques within the engineering design and manufacturing domains.

Implementing Practical DB2 Applications provides a concise source of information for the development and implication of applications using IBM's DB2 relational database package in the MVS environment.

All young computer scientists who aspire to write programs must learn something about algorithms and data structures.

A central problem in computer vision is to track objects as they move and deform in a video sequence.

Pseudorandom sequences have widespread applications, for instance, in spread spectrum, code division multiple access, optical and ultrawide band communication systems, as well as in ranging systems global positioning systems, circuit testing and stream ciphers.

This book, which is a rrMsion and extension of the original edition publi- shed in 1996 (see [2D with the German title Mathematik mit MA'nfCAD (Mathematics Using MA'nfCAD), discusses the use of the program system MAlHCAD(R) to solve mathematical problems with computers.

The fourth evolutionary/adaptive computing conference at the University of Plymouth again explores the utility of various evolutionary/adaptive search algorithms and complementary computational intelligence techniques within design and manufacturing.

Automata and Languages presents a step-by-step development of the theory of automata, languages and computation.

Network Algebra considers the algebraic study of networks and their behaviour.

Symbolic C++: An Introduction to Computer Algebra Using Object-Oriented Programming provides a concise introduction to C++ and object-oriented programming, using a step-by-step construction of a new object-oriented designed computer algebra system - Symbolic C++.

Maple is a computer algebraic system with a fast-growing number of users in schools, universities, and other institutions.

Essential Dynamic HTML fast provides a step-by-step approach to discovering DHTML and its techniques - everything you need to know from standard HTML tags to Layers and DOM (Document Object Model).

In The Unknowable I use LISP to compare my work on incompleteness with that of G6del and Turing, and in The Limits of Mathematics I use LISP to discuss my work on incompleteness in more detail.

Information is a key factor in business today, and data warehousing has become a major activity in the development and management of information systems to support the proper flow of information.

Although the computing demands of real-time signal processing and control applications are increasing rapidly, parallel processors permit several instructions to be dealt with simultaneously so that the "e;real-time"e; needed is manageable.

The recent explosive growth of our ability to generate and store data has created a need for new, scalable and efficient, tools for data analysis.

Lattice (Boolean) functions are algebraic functions defined over an arbitrary lattice (Boolean algebra), while lattice (Boolean) equations are equations expressed in terms of lattice (Boolean) functions.