|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
b3239443 |
| 003 |
MWH |
| 005 |
20191021191721.0 |
| 007 |
cr nn 008mamaa |
| 008 |
121227s2003 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540450283
|
| 024 |
7 |
|
|a 10.1007/3-540-45028-9
|2 doi
|
| 035 |
|
|
|a (DE-He213)978-3-540-45028-3
|
| 050 |
|
4 |
|a E-Book
|
| 072 |
|
7 |
|a UYQP
|2 bicssc
|
| 072 |
|
7 |
|a COM016000
|2 bisacsh
|
| 072 |
|
7 |
|a UYQP
|2 thema
|
| 245 |
1 |
0 |
|a Graph Based Representations in Pattern Recognition
|h [electronic resource] :
|b 4th IAPR International Workshop, GbRPR 2003, York, UK, June 30 - July 2, 2003. Proceedings /
|c edited by Edwin Hancock, Mario Vento.
|
| 250 |
|
|
|a 1st ed. 2003.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2003.
|
| 300 |
|
|
|a VIII, 276 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 2726
|
| 490 |
1 |
|
|a Springer eBook Collection
|
| 505 |
0 |
|
|a Data Structures and Representation -- Construction of Combinatorial Pyramids -- On Graphs with Unique Node Labels -- Constructing Stochastic Pyramids by MIDES — Maximal Independent Directed Edge Set -- Segmentation -- Functional Modeling of Structured Images -- Building of Symbolic Hierarchical Graphs for Feature Extraction -- Comparison and Convergence of Two Topological Models for 3D Image Segmentation -- Graph Edit Distance -- Tree Edit Distance from Information Theory -- Self-Organizing Graph Edit Distance -- Graph Edit Distance with Node Splitting and Merging, and Its Application to Diatom Identification -- Graph Matching -- Orthonormal Kernel Kronecker Product Graph Mdatching -- Theoretical Analysis and Experimental Comparison of Graph Matching Algorithms for Database Filtering -- A Comparison of Three Maximum Common Subgraph Algorithms on a Large Database of Labeled Graphs -- Swap Strategies for Graph Matching -- Matrix Methods -- Graph Matching Using Spectral Seriation and String Edit Distance -- Graph Polynomials, Principal Pivoting, and Maximum Independent Sets -- Graph Partition for Matching -- Graph Clustering -- Spectral Clustering of Graphs -- Comparison of Distance Measures for Graph-Based Clustering of Documents -- Some Experiments on Clustering a Set of Strings -- A New Median Graph Algorithm -- Graph Clustering Using the Weighted Minimum Common Supergraph -- ACM Attributed Graph Clustering for Learning Classes of Images -- A Competitive Winner-Takes-All Architecture for Classification and Pattern Recognition of Structures.
|
| 520 |
|
|
|a This volume contains the papers presented at the Fourth IAPR Workshop on Graph Based Representations in Pattern Recognition. The workshop was held at the King’s Manor in York, England between 30 June and 2nd July 2003. The previous workshops in the series were held in Lyon, France (1997), Haindorf, Austria (1999), and Ischia, Italy (2001). The city of York provided an interesting venue for the meeting. It has been said that the history of York is the history of England. There have been both Roman and Viking episodes. For instance, Constantine was proclaimed emperor in York. The city has also been a major seat of ecclesiastical power and was also involved in the development of the railways in the nineteenth century. Much of York’s history is evidenced by its buildings, and the King’s Manor is one of the most important and attractive of these. Originally part of the Abbey, after the dissolution of the monasteries by Henry VIII, the building became a center of government for the Tudors and the Stuarts (who stayed here regularly on their journeys between London and Edinburgh), serving as the headquarters of the Council of the North until it was disbanded in 1561. The building became part of the University of York at its foundation in 1963. The papers in the workshop span the topics of representation, segmentation, graph-matching, graph edit-distance, matrix and spectral methods, and gra- clustering.
|
| 590 |
|
|
|a Loaded electronically.
|
| 590 |
|
|
|a Electronic access restricted to members of the Holy Cross Community.
|
| 650 |
|
0 |
|a Pattern recognition.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Data structures (Computer science).
|
| 650 |
|
0 |
|a Computer science—Mathematics.
|
| 650 |
|
0 |
|a Computer graphics.
|
| 690 |
|
|
|a Electronic resources (E-books)
|
| 700 |
1 |
|
|a Hancock, Edwin.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Vento, Mario.
|e editor.
|0 (orcid)0000-0002-2948-741X
|1 https://orcid.org/0000-0002-2948-741X
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 2726
|
| 830 |
|
0 |
|a Springer eBook Collection.
|
| 856 |
4 |
0 |
|u https://holycross.idm.oclc.org/login?auth=cas&url=https://doi.org/10.1007/3-540-45028-9
|3 Click to view e-book
|t 0
|
| 907 |
|
|
|a .b32394433
|b 04-18-22
|c 02-26-20
|
| 998 |
|
|
|a he
|b 02-26-20
|c m
|d @
|e -
|f eng
|g gw
|h 0
|i 1
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 912 |
|
|
|a ZDB-2-BAE
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
| 902 |
|
|
|a springer purchased ebooks
|
| 903 |
|
|
|a SEB-COLL
|
| 945 |
|
|
|f - -
|g 1
|h 0
|j - -
|k - -
|l he
|o -
|p $0.00
|q -
|r -
|s b
|t 38
|u 0
|v 0
|w 0
|x 0
|y .i21526084
|z 02-26-20
|
| 999 |
f |
f |
|i 48be0706-344d-5e3b-bb82-8f8c6f3a8679
|s 1cdacc06-943b-5e0e-8445-3291840f4e96
|t 0
|
| 952 |
f |
f |
|p Online
|a College of the Holy Cross
|b Main Campus
|c E-Resources
|d Online
|t 0
|e E-Book
|h Library of Congress classification
|i Elec File
|