Welcome to our book review site go-pdf.online!
You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Extreme Value Theory with Applications to Natural Hazards
This richly illustrated book describes statistical extreme value theory for the quantification of natural hazards, such as strong winds, floods and rainfall, and discusses an interdisciplinary approach to allow the theoretical methods to be applied. The approach consists of a number of steps: data selection and correction, non-stationary theory (to account for trends due to climate change), and selecting appropriate estimation techniques based on both decision-theoretic features (e.g., Bayesian theory), empirical robustness and a valid treatment of uncertainties. It also examines and critically reviews alternative approaches based on stochastic and dynamic numerical models, as well as recently emerging data analysis issues and presents large-scale, multidisciplinary, state-of-the-art case studies. Intended for all those with a basic knowledge of statistical methods interested in the quantification of natural hazards, the book is also a valuable resource for engineers conducting risk analyses in collaboration with scientists from other fields (such as hydrologists, meteorologists, climatologists).
Web and Internet Economics
This book constitutes the thoroughly refereed conference proceedings of the 10th International Conference on Web and Internet Economics, WINE 2014, held in Beijing, China, in December 2014. The 32 regular and 13 short papers were carefully reviewed and selected from 107 submissions and cover results on incentives and computation in theoretical computer science, artificial intelligence, and microeconomics.
The Seventh European Conference on Combinatorics, Graph Theory and Applications
In the tradition of EuroComb'01 (Barcelona), Eurocomb'03 (Prague), EuroComb'05 (Berlin), Eurocomb'07 (Seville), Eurocomb'09 (Bordeaux), and Eurocomb'11 (Budapest), this volume covers recent advances in combinatorics and graph theory including applications in other areas of mathematics, computer science and engineering. Topics include, but are not limited to: Algebraic combinatorics, combinatorial geometry, combinatorial number theory, combinatorial optimization, designs and configurations, enumerative combinatorics, extremal combinatorics, ordered sets, random methods, topological combinatorics.
SOFSEM 2014: Theory and Practice of Computer Science
This book constitutes the refereed proceedings of the 40th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2014, held in Nový Smokovec, Slovakia, in January 2014. The 40 revised full papers presented in this volume were carefully reviewed and selected from 104 submissions. The book also contains 6 invited talks. The contributions covers topics as: Foundations of Computer Science, Software and Web Engineering, as well as Data, Information and Knowledge Engineering and Cryptography, Security and Verification.
On Infinite-Domain CSPs Parameterized by Solution Cost
In this thesis we study the computational complexity of MinCSP - an optimization version of the Constraint Satisfaction Problem (CSP). The input to a MinCSP is a set of variables and constraints applied to these variables, and the goal is to assign values (from a fixed domain) to the variables while minimizing the solution cost, i.e. the number of unsatisfied constraints. We are specifically interested in MinCSP with infinite domains of values. Infinite-domain MinCSPs model fundamental optimization problems in computer science and are of particular relevance to artificial intelligence, especially temporal and spatial reasoning. The usual way to study computational complexity of CSPs is to re...
Graph-Theoretic Concepts in Computer Science
This book constitutes the revised papers of the 45th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2019, held in Vall de Núria, Spain, in June 2019. The 29 full papers presented in this volume were carefully reviewed and selected from 87 submissions. They cover a wide range of areas, aiming at connecting theory and applications by demonstrating how graph-theoretic concepts can be applied in various areas of computer science. Another focus is on presenting recent results and on identifying and exploring promising directions of future research.
Fundamentals of Computation Theory
This book constitutes the proceedings of the 24th International Symposium on Fundamentals of Computation Theory, FCT 2023, held in Trier, Germany, in September 2023. The __ full papers included in this volume were carefully reviewed and selected from __ submissions. In addition, the book contains ____ invited talks. The papers cover topics of all aspects of theoretical computer science, in particular algorithms, complexity, formal and logical methods.
Fundamentals of Computation Theory
This book constitutes the refereed proceedings of the 21st International Symposium on Fundamentals of Computation Theory, FCT 2017, held in Bordeaux, France, in September 2017. The 29 revised full papers and 5 invited papers presented were carefully reviewed and selected from 99 submissions. The papers cover topics of all aspects of theoretical computer science, in particular algorithms, complexity, formal and logical methods.
Life Distributions
This book is devoted to the study of univariate distributions appropriate for the analyses of data known to be nonnegative. The book includes much material from reliability theory in engineering and survival analysis in medicine.
Matching minors in bipartite graphs
In this thesis we adapt fundamental parts of the Graph Minors series of Robertson and Seymour for the study of matching minors and investigate a connection to the study of directed graphs. We develope matching theoretic to established results of graph minor theory: We characterise the existence of a cross over a conformal cycle by means of a topological property. Furthermore, we develope a theory for perfect matching width, a width parameter for graphs with perfect matchings introduced by Norin. here we show that the disjoint alternating paths problem can be solved in polynomial time on graphs of bounded width. Moreover, we show that every bipartite graph with high perfect matching width mus...
