Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book brings together two important trends: graph algorithms and high-performance computing. Efficient and scalable execution of graph processing applications in data or network analysis requires innovations at multiple levels: algorithms, associated data structures, their implementation and tuning to a particular hardware. Further, programming languages and the associated compilers play a crucial role when it comes to automating efficient code generation for various architectures. This book discusses the essentials of all these aspects. The book is divided into three parts: programming, languages, and their compilation. The first part examines the manual parallelization of graph algorithms, revealing various parallelization patterns encountered, especially when dealing with graphs. The second part uses these patterns to provide language constructs that allow a graph algorithm to be specified. Programmers can work with these language constructs without worrying about their implementation, which is the focus of the third part. Implementation is handled by a compiler, which can specialize code generation for a backend device. The book also includes suggestive results on different platforms, which illustrate and justify the theory and practice covered. Together, the three parts provide the essential ingredients for creating a high-performance graph application. The book ends with a section on future directions, which offers several pointers to promising topics for future research. This book is intended for new researchers as well as graduate and advanced undergraduate students. Most of the chapters can be read independently by those familiar with the basics of parallel programming and graph algorithms. However, to make the material more accessible, the book includes a brief background on elementary graph algorithms, parallel computing and GPUs. Moreover it presents a case study using Falcon, a domain-specific language for graph algorithms, to illustrate the concepts.

Software engineering. --- Computer software engineering --- Engineering --- Computer science—Mathematics. --- Software Engineering. --- Discrete Mathematics in Computer Science.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book is a comprehensive treatment of the theory of persistence modules over the real line. It presents a set of mathematical tools to analyse the structure and to establish the stability of such modules, providing a sound mathematical framework for the study of persistence diagrams. Completely self-contained, this brief introduces the notion of persistence measure and makes extensive use of a new calculus of quiver representations to facilitate explicit computations. Appealing to both beginners and experts in the subject, The Structure and Stability of Persistence Modules provides a purely algebraic presentation of persistence, and thus complements the existing literature, which focuses mainly on topological and algorithmic aspects.

Algebraic topology. --- Algebra. --- Computer science—Mathematics. --- Computer mathematics. --- Algebraic Topology. --- Mathematical Applications in Computer Science.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Mathematics for Electrical Engineering and Computing embraces many applications of modern mathematics, such as Boolean Algebra and Sets and Functions, and also teaches both discrete and continuous systems - particularly vital for Digital Signal Processing (DSP). In addition, as most modern engineers are required to study software, material suitable for Software Engineering - set theory, predicate and prepositional calculus, language and graph theory - is fully integrated into the book.Excessive technical detail and language are avoided, recognising that the real requirement for

Computer science - Mathematics. --- Electric engineering - Mathematics. --- Electric engineering--Mathematics. Computer science--Mathematics. --- Electrical engineering --- Computer science --- Electrical Engineering --- Electrical & Computer Engineering --- Engineering & Applied Sciences --- Mathematics --- Mathematics. --- Computer mathematics --- Discrete mathematics --- Electronic data processing --- Engineering mathematics

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book gathers the proceedings of the 2018 Abel Symposium, which was held in Geiranger, Norway, on June 4-8, 2018. The symposium offered an overview of the emerging field of "Topological Data Analysis". This volume presents papers on various research directions, notably including applications in neuroscience, materials science, cancer biology, and immune response. Providing an essential snapshot of the status quo, it represents a valuable asset for practitioners and those considering entering the field.

Algebraic topology --- Algebraic topology. --- Medicine. --- Computer science—Mathematics. --- Algebraic Topology. --- Biomedicine, general. --- Mathematics of Computing. --- Health Workforce --- Topology

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This volume constitutes the proceedings of the 9th International Conference on Variable Neighborhood Search, ICVNS 2023, held in Abu Dhabi, United Arab Emirates, in October 2022. The 11 full papers presented in this volume were carefully reviewed and selected from 29 submissions. The papers describe recent advances in methods and applications of variable neighborhood search.

Computer science—Mathematics. --- Discrete mathematics. --- Algorithms. --- Mathematics of Computing. --- Discrete Mathematics in Computer Science. --- Design and Analysis of Algorithms. --- Mathematics