Graph-Based Representations in Pattern Recognition: 9th IAPR-TC-15 International Workshop, GbRPR 2013, Vienna, Austria, May 15-17, 2013, Proceedings: Lecture Notes in Computer Science, cartea 7877
Editat de Walter Kropatsch, Nicole M. Artner, Yll Haxhimusa, Xiaoyi Jiangen Limba Engleză Paperback – 17 mai 2013
Din seria Lecture Notes in Computer Science
- 20% Preț: 1043.63 lei
- 20% Preț: 334.61 lei
- 20% Preț: 336.22 lei
- 20% Preț: 445.69 lei
- 20% Preț: 238.01 lei
- 20% Preț: 334.61 lei
- 20% Preț: 438.69 lei
- Preț: 442.03 lei
- 20% Preț: 337.87 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 634.41 lei
- 17% Preț: 427.22 lei
- 20% Preț: 643.99 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1057.10 lei
- 20% Preț: 581.55 lei
- Preț: 374.84 lei
- 20% Preț: 331.36 lei
- 15% Preț: 431.22 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1390.89 lei
- 20% Preț: 1007.16 lei
- 20% Preț: 569.54 lei
- 20% Preț: 575.48 lei
- 20% Preț: 573.59 lei
- 20% Preț: 750.35 lei
- 15% Preț: 570.71 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 347.59 lei
- 20% Preț: 576.02 lei
- Preț: 404.00 lei
- 20% Preț: 586.43 lei
- 20% Preț: 750.35 lei
- 20% Preț: 812.01 lei
- 20% Preț: 649.49 lei
- 20% Preț: 344.34 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 420.72 lei
Preț vechi: 525.90 lei
-20% Nou
Puncte Express: 631
Preț estimativ în valută:
80.54€ • 83.72$ • 66.78£
80.54€ • 83.72$ • 66.78£
Carte tipărită la comandă
Livrare economică 07-21 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642382208
ISBN-10: 3642382207
Pagini: 268
Ilustrații: XII, 255 p. 83 illus.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.38 kg
Ediția:2013
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Image Processing, Computer Vision, Pattern Recognition, and Graphics
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3642382207
Pagini: 268
Ilustrații: XII, 255 p. 83 illus.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.38 kg
Ediția:2013
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Image Processing, Computer Vision, Pattern Recognition, and Graphics
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.