Graph-Based Representations in Pattern Recognition
Editat de Walter Kropatsch, Nicole M. Artner, Yll Haxhimusa, Xiaoyi Jiangen Limba Engleză Paperback – 17 mai 2013
Preț: 413.83 lei
Preț vechi: 517.29 lei
-20%
Puncte Express: 621
Preț estimativ în valută:
73.18€ • 83.91$ • 63.24£
73.18€ • 83.91$ • 63.24£
Carte tipărită la comandă
Livrare economică 28 aprilie-12 mai
Specificații
ISBN-13: 9783642382208
ISBN-10: 3642382207
Pagini: 268
Ilustrații: XII, 255 p. 83 illus.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.41 kg
Ediția:2013
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642382207
Pagini: 268
Ilustrații: XII, 255 p. 83 illus.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.41 kg
Ediția:2013
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
A One Hour Trip in the World of Graphs, Looking at the Papers of the Last Ten Years.- A Unified Framework for Strengthening Topological Node Features and Its Application to Subgraph Isomorphism Detection.- On the Complexity of Submap Isomorphism.- Flooding Edge Weighted Graphs.- Graph Matching with Nonnegative Sparse Model.- TurboTensors for Entropic Image Comparison.- Active-Learning Query Strategies Applied to Select a Graph Node Given a Graph Labelling.- GMTE: A Tool for Graph Transformation and Exact/Inexact Graph Matching.- A Comparison of Explicit and Implicit Graph Embedding Methods for Pattern Recognition.- Adjunctions on the Lattice of Dendrograms.- A Continuous-Time Quantum Walk Kernel for Unattributed Graphs.- Relevant Cycle Hypergraph Representation for Molecules.- A Quantum Jensen-Shannon Graph Kernel Using the Continuous-Time Quantum Walk.- Treelet Kernel Incorporating Chiral Information.- A Novel Software Toolkit for Graph Edit Distance Computation.- Map Edit Distance vs. Graph Edit Distance for Matching Images.- An Algorithm for Maximum Common Subgraph of Planar Triangulation Graphs.- Graph Characteristics from the Schrödinger Operator.- Persistent Homology in Image Processing.- Towards Minimal Barcodes.- A Fast Matching Algorithm for Graph-Based Handwriting Recognition.- On the Evaluation of Graph Centrality for Shape Matching.- Shape Recognition as a Constraint Satisfaction Problem.- Gaussian Wave Packet on a Graph.- Exact Computation of Median Surfaces Using Optimal 3D Graph Search.- Estimation of Distribution Algorithm for the Max-Cut Problem.
Caracteristici
Conference proceedings of the International Workshop on Graph-Based Representations in Pattern Recognition, Gb.