This book, Advanced Tools and Methods for Treewidth-Based Problem Solving, contains selected results from the authors PhD studies, which were carried out from 2015 to 2021. For his PhD thesis, Markus Hecher received the EurAI Dissertation Award 2021...Daugiau...
Tree-based methods for statistical learning in R provides a thorough introduction to both individual decision tree algorithms (Part I) and ensembles thereof (Part II). Part I of the book brings several different tree algorithms into focus, both conv...Daugiau...
This authoritative state-of-the-art account of probability on networks for graduate students and researchers in mathematics, statistics, computer science, and engineering, brings together sixty years of research, including many developments where the...Daugiau...
Davenport-Zannier polynomials take their origin in number theory, and Adrianov, Pakovich, and Zvonkin show how to prove some long-standing conjectures about them and formulate new ones by drawing simple pictures-what the French call dessins denf...Daugiau...
A chain event graph (CEG) is an important generalization of the Bayesian Network (BN). BNs have been extremely useful for modeling discrete processes. However, they are not appropriate for all applications. Over the past six years or so, teams of...Daugiau...
Nesetril and de Mendez introduce a general framework for the study of limits of relational structures-graphs in particular-that is based on a combination of model theory and functional analysis. They show how the various approaches to graph limit...Daugiau...
A chain event graph (CEG) is an important generalization of the Bayesian Network (BN). BNs have been extremely useful for modeling discrete processes. However, they are not appropriate for all applications. Over the past six years or so, teams of...Daugiau...
Serija: Cambridge Series in Statistical and Probabilistic Mathematics
(Išleidimo metai: 20-Jan-2017, Hardback, Leidėjas: Cambridge University Press, ISBN-13: 9781107160156)
This authoritative state-of-the-art account of probability on networks for graduate students and researchers in mathematics, statistics, computer science, and engineering, brings together sixty years of research, including many developments where th...Daugiau...
This book explores fundamental aspects of geometric network optimisation with applications to a variety of real world problems. It presents, for the first time in the literature, a cohesive mathematical framework within which the properties of suc...Daugiau...
Serija: The Morgan Kaufmann Series in Data Management Systems
(Išleidimo metai: 22-Feb-2012, Paperback / softback, Leidėjas: Morgan Kaufmann Publishers In, ISBN-13: 9780123877338)
Provides information on developing database applications in SQL, covering such topics as adjacendy list model, nested sets, binary trees, data modeling, graphs, and hierarchical database systems. The demand for SQL information and training...Daugiau...
Discrete mathematics is fundamental to computer science, and this up-to-date text assists undergraduates in mastering the ideas and mathematical language to address problems that arise in the fields many applications. It consists of 4 unit...Daugiau...
Thomas Duquesne, Ole E Barndorff-Nielsen, Oleg Reichmann, Jean Bertoin, Ken-iti Sato, Jean Jacod, Christoph Schwab, Claudia Klüppelberg
Serija: Lecture Notes in Mathematics
(Išleidimo metai: 05-Sep-2010, Paperback / softback, Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783642140068)
This series reports on new developments in mathematical research and teaching-quickly, informally and at a high level.Texts that are out of print but still in demand may also be considered.The timeliness of a manuscript is sometimes m...Daugiau...
Trees are a fundamental object in graph theory and combinatorics as well as a basic object for data structures and algorithms in computer science. During the last years research related to (random) trees has been constantly increasing and several asy...Daugiau...
(Išleidimo metai: 12-Oct-2007, Paperback / softback, Leidėjas: Springer-Verlag Berlin and Heidelberg GmbH & Co. K, ISBN-13: 9783540747970)
Random trees and tree-valued stochastic processes are of particular importance in combinatorics, computer science, phylogenetics, and mathematical population genetics. Using the framework of abstract tree-like metric spaces (so-called real trees) a...Daugiau...
(Išleidimo metai: 08-Jan-2007, Hardback, Leidėjas: Cambridge University Press, ISBN-13: 9780521815130)
Aimed at an audience of researchers and graduate students in computational geometry and algorithm design, this book uses the Geometric Spanner Network Problem to showcase a number of useful algorithmic techniques, data structure strategies, and geome...Daugiau...
A textbook for graduate or advanced undergraduate students in computer science, electrical or industrial engineering, and mathematics on an area important to algorithm design. It covers the full spectrum of spanning tree algorithms from classical com...Daugiau...
H. Bass, Hyman Bass, L. Carbone, Alexander Lubotzky, A. Lunotzky, G. Rosenberg, J. Tits
Serija: Progress in Mathematics
(Išleidimo metai: 17-Nov-2000, Hardback, Leidėjas: Birkhauser Boston Inc, ISBN-13: 9780817641207)
Group actions on trees furnish a unified geometric way of recasting the chapter of combinatorial group theory dealing with free groups, amalgams, and HNN extensions. Some of the principal examples arise from rank one simple Lie groups over a non-arch...Daugiau...
Trees, sometimes called semilinear orders, are partially ordered sets in which every initial segment determined by an element is linearly ordered. This text focuses on automorphism groups of trees, providing a nearly complete analysis of when two tre...Daugiau...
