Combinatorial Pattern Matching, Maxime Crochemore; Dan Gusfield
Автор: Alberto Apostolico; Maxime Crochemore; Zvi Galil; Название: Combinatorial Pattern Matching ISBN: 3540560246 ISBN-13(EAN): 9783540560241 Издательство: Springer Рейтинг: Цена: 43780.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Combinatorial pattern matching is a field dealing with the searching and matching of strings and other, more complicated patterns such as trees, regular expressions and extended expressions. This volume contains a series of papers presented at a symposium on the subject.
Автор: Dan Hirschberg; Gene Meyers Название: Combinatorial Pattern Matching ISBN: 3540612580 ISBN-13(EAN): 9783540612582 Издательство: Springer Рейтинг: Цена: 74530.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Comprising 26 papers presented at the 7th Annual Symposium on Combinatorial Pattern Matching (CPM), this work examines the importance of CPM, an area of algorithmics, in information retrieval, pattern recognition, compiling, data compression, program analysis, and molecular biology.
Автор: Dechang Chen; Xiuzhen Cheng Название: Pattern Recognition and String Matching ISBN: 1402009534 ISBN-13(EAN): 9781402009532 Издательство: Springer Рейтинг: Цена: 231990.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Presents a collection of 28 articles contributed by experts of pattern recognition, string matching, or both. This book contains fundamental concepts and notations, as well as reports on research with respect to both methodology and applications. It also includes string matching related techniques for structural pattern recognition.
Автор: Dechang Chen; Xiuzhen Cheng Название: Pattern Recognition and String Matching ISBN: 1461379520 ISBN-13(EAN): 9781461379522 Издательство: Springer Рейтинг: Цена: 163040.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: The research and development of pattern recognition have proven to be of importance in science, technology, and human activity. The aim, intent, and motivation for publishing this book is to pro- vide a reference tool for the increasing number of readers who depend upon pattern recognition or string matching in some way.
Автор: Korte, Bernhard, Vygen, Jens Название: Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed. ISBN: 3642244874 ISBN-13(EAN): 9783642244872 Издательство: Springer Рейтинг: Цена: 60510.00 T Наличие на складе: Невозможна поставка. Описание: This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.
Автор: Schrijver Alexander Название: Combinatorial Optimization / Polyhedra and Efficiency ISBN: 3540443894 ISBN-13(EAN): 9783540443896 Издательство: Springer Рейтинг: Цена: 113660.00 T Наличие на складе: Поставка под заказ. Описание: This book offers an in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization.These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4000 references to further research are given, and historical surveys on the basic subjects are presented.
Автор: Edelsbrunner Herbert Название: Algorithms in Combinatorial Geometry ISBN: 3642648738 ISBN-13(EAN): 9783642648731 Издательство: Springer Цена: 121070.00 T Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Wolsey, Laurence A. (universite Catholique De Louv Название: Integer and combinatorial optimization ISBN: 0471359432 ISBN-13(EAN): 9780471359432 Издательство: Wiley Рейтинг: Цена: 165740.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Discrete optimization models are used to tackle a wide variety of problems in many fields, including operations research, management science, engineering, and mathematics. Written by two internationally recognized integer programming experts, this book presents the mathematical foundations, theory, and algorithms of discrete optimization methods.
Казахстан, 010000 г. Астана, проспект Туран 43/5, НП2 (офис 2) ТОО "Логобук" Тел:+7 707 857-29-98 ,+7(7172) 65-23-70 www.logobook.kz
