Combinatorial Pattern Matching, Zvi Galil; Esko Ukkonen

Автор: Alexander S. Kulikov; Sergei O. Kuznetsov; Pavel P
Название: Combinatorial Pattern Matching
ISBN: 3319075659 ISBN-13(EAN): 9783319075655
Издательство: Springer
Рейтинг:
Цена: 68010.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 25th Annual Symposium on Combinatorial Pattern Matching, CPM 2014, held in Moscow, Russia, in June 2014. The goal is to derive combinatorial properties of such structures and to exploit these properties in order to achieve superior performance for the corresponding computational problems.

Автор: Alberto Apostolico; Jotun Hein
Название: Combinatorial Pattern Matching
ISBN: 3540632204 ISBN-13(EAN): 9783540632207
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This volume comprises the proceedings of the Eighth Annual Symposium on Combinatorial Pattern Matching, CPM 97. It is devoted to the issues of searching and matching strings and more complicated patterns, such as trees, regular expressions, graphs, point sets and arrays.

Автор: 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.

Автор: Raffaele Giancarlo; David Sankoff
Название: Combinatorial Pattern Matching
ISBN: 3540676333 ISBN-13(EAN): 9783540676331
Издательство: Springer
Рейтинг:
Цена: 81050.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The refereed proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching (CPM 2000). Papers cover theoretical and algorithmic issues of searching and matching strings and more complicated patterns, as well as advanced applications of CPM in areas such as computational biology.

Автор: 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.

Автор: Martin Farach-Colton
Название: Combinatorial Pattern Matching
ISBN: 3540647392 ISBN-13(EAN): 9783540647393
Издательство: Springer
Рейтинг:
Цена: 65210.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Taken from proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching, held in New Jersey, July 1998 (CPM `98), this text includes issues in combinatorial pattern matching, dealing with a variety of classical objects to be matched as well as with DNA coding.

Автор: J?r?me Euzenat; Pavel Shvaiko
Название: Ontology Matching
ISBN: 3662500426 ISBN-13(EAN): 9783662500422
Издательство: Springer
Рейтинг:
Цена: 93160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book explores ontology matching as a solution to the semantic heterogeneity problem faced by computer systems. Also covers emerging topics such as data interlinking, ontology partitioning and pruning, and user involvement in matching.

Название: Ontology Matching
ISBN: 3642387209 ISBN-13(EAN): 9783642387203
Издательство: Springer
Рейтинг:
Цена: 130430.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book explores ontology matching as a solution to the semantic heterogeneity problem faced by computer systems. Also covers emerging topics such as data interlinking, ontology partitioning and pruning, and user involvement in matching.

Автор: 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.

Название: Combinatorial optimization and applications
ISBN: 3642020259 ISBN-13(EAN): 9783642020254
Издательство: Springer
Рейтинг:
Цена: 93160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the Third International Conference on Combinatorial Optimization and Applications, COCOA 2009, held in Huangshan, China, in June 2009.

Автор: Reneta P. Barneva; Bhargab B. Bhattacharya; Valent
Название: Combinatorial Image Analysis
ISBN: 3319261444 ISBN-13(EAN): 9783319261447
Издательство: Springer
Рейтинг:
Цена: 52170.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This volume constitutes the refereed proceedings of the17th International Workshop on Combinatorial Image Analysis, IWCIA 2015, heldin Kolkata, India, in November 2015. The 24 revised full papers and 2 invited papers presentedwere carefully reviewed and selected from numerous submissions.

Автор: Kratochv?l Jan; Mirka Miller; Dalibor Froncek
Название: Combinatorial Algorithms
ISBN: 3319193147 ISBN-13(EAN): 9783319193144
Издательство: Springer
Рейтинг:
Цена: 52170.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:

On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism.- Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem.- Quantifying Privacy: A Novel Entropy-Based Measure of Disclosure Risk.- On the Galois Lattice of Bipartite Distance Hereditary Graphs.- Fast Simple Computations Using Prefix Tables under Hamming and Edit Distance.- Border Correlations, Lattices and the Subgraph Component Polynomial.- Computing Minimum Length Representations of Sets of Words of Uniform Length.- Computing Primitively-Rooted Squares and Runs in Partial Words.- 3-coloring triangle-free planar graphs with a precolored 9-cycle.- Computing Heat Kernel Pagerank and a Local Clustering Algorithm.- Solving Matching Problems Efficiently in Bipartite Graphs.- A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras.- On decomposing the complete graph into the union of two disjoint cycles.- Reconfiguration of Vertex Covers in a Graph.- Space Efficient Data Structures for Nearest Larger Neighbor Playing several variants of Mastermind with constant-size memory is not harder than with unbounded memory.- On Maximum Common Subgraph Problems in Series-Parallel Graphs.- Profile-based optimal matchings in the Student/Project Allocation Problem.- The Min-Max Edge q-Coloring Problem.- Speeding up Graph Algorithms via Switching Classes.- Metric Dimension for Amalgamations of Graphs.- Deterministic Algorithms for the Independent Feedback Vertex Set Problem.- Lossless seeds for searching short patterns with high error rates.