Описание: This new work addresses increasingly useful methods for recognizing product graphs.
Автор: Blahut Richard E., Koetter Ralf Название: Codes, Graphs, and Systems ISBN: 0792376862 ISBN-13(EAN): 9780792376866 Издательство: Springer Рейтинг: Цена: 14959 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Foreword by James L. Massey. Codes, Graphs, and Systems is an excellent reference for both academic researchers and professional engineers working in the fields of communications and signal processing. A collection of contributions from world-renowned experts in coding theory, information theory, and signal processing, the book provides a broad perspective on contemporary research in these areas. Survey articles are also included. Specific topics covered include convolutional codes and turbo codes; detection and equalization; modems; physics and information theory; lattices and geometry; and behaviors and codes on graphs.Codes, Graphs, and Systems is a tribute to the leadership and profound influence of G. David Forney, Jr. The 35 contributors to the volume have assembled their work in his honor.
Описание: Reasoning and Unification over Conceptual Graphs is an exploration of automated reasoning and resolution in the expanding field of Conceptual Structures. Designed not only for computing scientists researching Conceptual Graphs, but also for anyone interested in exploring the design of knowledge bases, the book explores what are proving to be the fundamental methods for representing semantic relations in knowledge bases. While it provides the first comprehensive treatment of Conceptual Graph unification and reasoning, the book also addresses fundamental issues of graph matching, automated reasoning, knowledge bases, constraints, ontology and design. With a large number of examples, illustrations, and both formal and informal definitions and discussions, this book is excellent as a tutorial for the reader new to Conceptual Graphs, or as a reference book for a senior researcher in Artificial Intelligence, Knowledge Representation or Automated Reasoning.
Описание: The aim of contextual logic is to provide a formal theory of elementary logic, which is based on the doctrines of concepts, judgements, and conclusions. Concepts are mathematized using Formal Concept Analysis (FCA), while an approach to the formalization of judgements and conclusions is conceptual graphs, based on Peirce's existential graphs. Combining FCA and a mathematization of conceptual graphs yields so-called concept graphs, which offer a formal and diagrammatic theory of elementary logic. Expressing negation in contextual logic is a difficult task. Based on the author's dissertation, this book shows how negation on the level of judgements can be implemented. To do so, cuts (syntactical devices used to express negation) are added to concept graphs. As we can express relations between objects, conjunction and negation in judgements, and existential quantification, the author demonstrates that concept graphs with cuts have the expressive power of first-order predicate logic. While doing so, the author distinguishes between syntax and semantics, and provides a sound and complete calculus for concept graphs with cuts. The author's treatment is mathematically thorough and consistent, and the book gives the necessary background on existential and conceptual graphs.
Автор: Valiente Gabriel Название: Algorithms on Trees and Graphs ISBN: 3540435506 ISBN-13(EAN): 9783540435501 Издательство: Springer Рейтинг: Цена: 6264 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: From their first local hit, "Buttered Popcorn" with Florence Ballard singing lead with the The Primettes, the Supremes would go on to become the most popular female signing group of all time. When "Dream Girl" and "Supreme Faith" were first published, it caused a sensation - this is the story. Introduces graph algorithms on an intuitive basis followed by an exposition in a literate programming style, with correctness proofs as well as worst-case analyses. This book provides C++ implementations of algorithms using the LEDA library of data structures and algorithms.
Автор: Spencer Joel Название: The Strange Logic of Random Graphs ISBN: 3540416544 ISBN-13(EAN): 9783540416548 Издательство: Springer Рейтинг: Цена: 12154 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The study of random graphs was begun by Paul Erdos and Alfred Renyi in the 1960s and now has a comprehensive literature. A compelling element has been the threshold function, a short range in which events rapidly move from almost certainly false to almost certainly true. This book now joins the study of random graphs (and other random discrete objects) with mathematical logic. The possible threshold phenomena are studied for all statements expressible in a given language. Often there is a zero-one law, that every statement holds with probability near zero or near one. The methodologies involve probability, discrete structures and logic, with an emphasis on discrete structures.The book will be of interest to graduate students and researchers in discrete mathematics.
Автор: A.T. White Название: Graphs of Groups on Surfaces,188 ISBN: 0444500758 ISBN-13(EAN): 9780444500755 Издательство: Elsevier Science Рейтинг: Цена: 16830 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Studies automorphism groups of both graphs and maps. This book includes chapters on the subfields of enumerative topological graph theory and random topological graph theory, as well as on the composition of English church-bell music. It places emphasis on Cayley maps: imbeddings of Cayley graphs for finite groups.
Автор: Martin Charles Golumbic Название: Algorithmic Graph Theory and Perfect Graphs,57 ISBN: 0444515305 ISBN-13(EAN): 9780444515308 Издательство: Elsevier Science Рейтинг: Цена: 6260 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Conveys the message that intersection graph models are a necessary and important tool for solving real-world problems. This edition includes an Epilogue chapter, which covers topics such as the theory and applications of intersection graph models such as generalizations of permutation graphs and interval graphs.
Автор: Aldous Название: Graphs and Applications ISBN: 185233259X ISBN-13(EAN): 9781852332594 Издательство: Springer Рейтинг: Цена: 4203 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Discrete Mathematics is one of the fastest growing areas in mathematics with an ever-increasing number of courses in schools and universities. This book includes problem solving for learning graph theory, and large numbers of examples, problems and exercises. It is accompanied by a CD-ROM comprising a Graphs Database and a Graphs Editor.
Автор: Kocay, William Название: Graphs, Algorithms, and Optimization ISBN: 1584883960 ISBN-13(EAN): 9781584883968 Издательство: Taylor&Francis Цена: 3656 р. Наличие на складе: Поставка под заказ.
Описание: A valuable resource for mathematics and computer science students and professionals, Graphs, Algorithms and Optimization presents the theory of graphs from an algorithmic point of view. The authors cover the key topics in graph theory and introduce discrete optimization and its connection to graph theory. The book contains a wealth of information on algorithms and the data structures needed to program them efficiently. Many programming techniques used for algorithms, discussions on algorithmic complexity and efficiency, a chapter on NP-completeness, and three chapters on linear optimization are also included. The graph theory presented is rigorous, but the style is informal.
Автор: Jensen Название: Bayesian Networks and Decision Graphs ISBN: 0387682813 ISBN-13(EAN): 9780387682815 Издательство: Springer Рейтинг: Цена: 9349 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This is a new edition of an essential work on Bayesian networks and decision graphs. It is an introduction to probabilistic graphical models including Bayesian networks and influence diagrams. It presents a thorough introduction to state-of-the-art solution and analysis algorithms.
Описание: Discrete mathematics, including (combinatorial) number theory and set theory has always been a stronghold of Hungarian mathematics. The present volume honouring Vera Sos and Andras Hajnal contains survey articles (with classical theorems and state-of-the-art results) and cutting edge expository research papers with new theorems and proofs in the area of the classical Hungarian subjects, like extremal combinatorics, colorings, combinatorial number theory, etc. The open problems and the latest results in the papers inspire further research. The volume is recommended to experienced specialists as well as to young researchers and students.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru