000 03950nam a22004095i 4500
001 308216
003 MX-SnUAN
005 20170705134317.0
007 cr nn 008mamaa
008 150903s2013 gw | o |||| 0|eng d
020 _a9783642382215
_99783642382215
024 7 _a10.1007/9783642382215
_2doi
035 _avtls000361438
039 9 _a201509031031
_bVLOAD
_c201405070314
_dVLOAD
_y201402210947
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQ337.5
100 1 _aKropatsch, Walter G.
_eeditor.
_9329404
245 1 0 _aGraph-Based Representations in Pattern Recognition :
_b9th IAPR-TC-15 International Workshop, GbRPR 2013, Vienna, Austria, May 15-17, 2013. Proceedings /
_cedited by Walter G. Kropatsch, Nicole M. Artner, Yll Haxhimusa, Xiaoyi Jiang.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2013.
300 _axii, 255 páginas 83 ilustraciones
_brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v7877
500 _aSpringer eBooks
505 0 _aA 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.
520 _aThis book constitutes the refereed proceedings of the 9th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition, GbRPR 2013, held in Vienna, Austria, in May 2013. The 24 papers presented in this volume were carefully reviewed and selected from 27 submissions. They are organized in topical sections named: finding subregions in graphs; graph matching; classification; graph kernels; properties of graphs; topology; graph representations, segmentation and shape; and search in graphs.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aArtner, Nicole M.
_eeditor.
_9348061
700 1 _aHaxhimusa, Yll.
_eeditor.
_9348062
700 1 _aJiang, Xiaoyi.
_eeditor.
_9332131
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783642382208
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-642-38221-5
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c308216
_d308216