Mathematical Foundations of Computer Science 2015
Mathematical Foundations of Computer Science 2015

Author: Giuseppe F. Italiano

Publisher: Springer

Published: 2015-08-10

Total Pages: 633

ISBN-13: 3662480549

DOWNLOAD EBOOK

This two volume set LNCS 9234 and 9235 constitutes the refereed conference proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science, MFCS 2015, held in Milan, Italy, in August 2015. The 82 revised full papers presented together with 5 invited talks were carefully selected from 201 submissions. The papers feature high-quality research in all branches of theoretical computer science. They have been organized in the following topical main sections: logic, semantics, automata, and theory of programming (volume 1) and algorithms, complexity, and games (volume 2).

Algorithms – ESA 2013
Algorithms – ESA 2013

Author: Hans L. Bodlaender

Publisher: Springer

Published: 2013-08-16

Total Pages: 846

ISBN-13: 3642404502

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 21st Annual European Symposium on Algorithms, ESA 2013, held in Sophia Antipolis, France, in September 2013 in the context of the combined conference ALGO 2013. The 69 revised full papers presented were carefully reviewed and selected from 303 initial submissions: 53 out of 229 in track "Design and Analysis" and 16 out of 74 in track "Engineering and Applications". The papers in this book present original research in all areas of algorithmic research, including but not limited to: algorithm engineering; algorithmic aspects of networks; algorithmic game theory; approximation algorithms; computational biology; computational finance; computational geometry; combinatorial optimization; data compression; data structures; databases and information retrieval; distributed and parallel computing; graph algorithms; hierarchical memories; heuristics and meta-heuristics; mathematical programming; mobile computing; on-line algorithms; parameterized complexity; pattern matching; quantum computing; randomized algorithms; scheduling and resource allocation problems; streaming algorithms.

Adversarial and Uncertain Reasoning for Adaptive Cyber Defense
Adversarial and Uncertain Reasoning for Adaptive Cyber Defense

Author: Sushil Jajodia

Publisher: Springer Nature

Published: 2019-08-30

Total Pages: 270

ISBN-13: 3030307190

DOWNLOAD EBOOK

Today’s cyber defenses are largely static allowing adversaries to pre-plan their attacks. In response to this situation, researchers have started to investigate various methods that make networked information systems less homogeneous and less predictable by engineering systems that have homogeneous functionalities but randomized manifestations. The 10 papers included in this State-of-the Art Survey present recent advances made by a large team of researchers working on the same US Department of Defense Multidisciplinary University Research Initiative (MURI) project during 2013-2019. This project has developed a new class of technologies called Adaptive Cyber Defense (ACD) by building on two active but heretofore separate research areas: Adaptation Techniques (AT) and Adversarial Reasoning (AR). AT methods introduce diversity and uncertainty into networks, applications, and hosts. AR combines machine learning, behavioral science, operations research, control theory, and game theory to address the goal of computing effective strategies in dynamic, adversarial environments.

Network Flow Algorithms
Network Flow Algorithms

Author: David P. Williamson

Publisher: Cambridge University Press

Published: 2019-09-05

Total Pages: 327

ISBN-13: 1316946665

DOWNLOAD EBOOK

Network flow theory has been used across a number of disciplines, including theoretical computer science, operations research, and discrete math, to model not only problems in the transportation of goods and information, but also a wide range of applications from image segmentation problems in computer vision to deciding when a baseball team has been eliminated from contention. This graduate text and reference presents a succinct, unified view of a wide variety of efficient combinatorial algorithms for network flow problems, including many results not found in other books. It covers maximum flows, minimum-cost flows, generalized flows, multicommodity flows, and global minimum cuts and also presents recent work on computing electrical flows along with recent applications of these flows to classical problems in network flow theory.

Introduction to Property Testing
Introduction to Property Testing

Author: Oded Goldreich

Publisher: Cambridge University Press

Published: 2017-11-23

Total Pages: 473

ISBN-13: 1107194059

DOWNLOAD EBOOK

An extensive and authoritative introduction to property testing, the study of super-fast algorithms for the structural analysis of large quantities of data in order to determine global properties. This book can be used both as a reference book and a textbook, and includes numerous exercises.

Spectral Graph Theory
Spectral Graph Theory

Author: Fan R. K. Chung

Publisher: American Mathematical Soc.

Published: 1997

Total Pages: 228

ISBN-13: 0821803158

DOWNLOAD EBOOK

This text discusses spectral graph theory.

Computational Topology for Data Analysis
Computational Topology for Data Analysis

Author: Tamal Krishna Dey

Publisher: Cambridge University Press

Published: 2022-03-10

Total Pages: 456

ISBN-13: 1009103199

DOWNLOAD EBOOK

Topological data analysis (TDA) has emerged recently as a viable tool for analyzing complex data, and the area has grown substantially both in its methodologies and applicability. Providing a computational and algorithmic foundation for techniques in TDA, this comprehensive, self-contained text introduces students and researchers in mathematics and computer science to the current state of the field. The book features a description of mathematical objects and constructs behind recent advances, the algorithms involved, computational considerations, as well as examples of topological structures or ideas that can be used in applications. It provides a thorough treatment of persistent homology together with various extensions – like zigzag persistence and multiparameter persistence – and their applications to different types of data, like point clouds, triangulations, or graph data. Other important topics covered include discrete Morse theory, the Mapper structure, optimal generating cycles, as well as recent advances in embedding TDA within machine learning frameworks.

Integer Programming and Combinatorial Optimization
Integer Programming and Combinatorial Optimization

Author: Andrea Lodi

Publisher: Springer

Published: 2019-05-02

Total Pages: 464

ISBN-13: 3030179532

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 20th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2019, held in Ann Arbor, MI, USA, in May 2019. The 33 full versions of extended abstracts presented were carefully reviewed and selected from 114 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications in these areas.

Factor Graphs for Robot Perception
Factor Graphs for Robot Perception

Author: Frank Dellaert

Publisher:

Published: 2017-08-15

Total Pages: 162

ISBN-13: 9781680833263

DOWNLOAD EBOOK

Reviews the use of factor graphs for the modeling and solving of large-scale inference problems in robotics. Factor graphs are introduced as an economical representation within which to formulate the different inference problems, setting the stage for the subsequent sections on practical methods to solve them.