default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4. GbRPR 2003: York, UK
- Edwin R. Hancock
, Mario Vento:
Graph Based Representations in Pattern Recognition, 4th IAPR International Workshop, GbRPR 2003, York, UK, June 30 - July 2, 2003, Proceedings. Lecture Notes in Computer Science 2726, Springer 2003, ISBN 3-540-40452-X
Data Structures and Representation
- Luc Brun, Walter G. Kropatsch:
Construction of Combinatorial Pyramids. 1-12 - Peter J. Dickinson, Horst Bunke, Arek Dadej, Miro Kraetzl:
On Graphs with Unique Node Labels. 13-23 - Yll Haxhimusa, Roland Glantz, Walter G. Kropatsch:
Constructing Stochastic Pyramids by MIDES - Maximal Independent Directed Edge Set. 24-34
Segmentation
- Jocelyn Marchadier, Walter G. Kropatsch:
Functional Modeling of Structured Images. 35-46 - Mickaël Melki, Jean-Michel Jolion:
Building of Symbolic Hierarchical Graphs for Feature Extraction. 47-58 - Achille J.-P. Braquelaire, Guillaume Damiand, Jean-Philippe Domenger, Frédéric Vidil:
Comparison and Convergence of Two Topological Models for 3D Image Segmenation. 59-70
Graph Edit Distance
- Andrea Torsello, Edwin R. Hancock:
Tree Edit Distance from Information Theory. 71-82 - Michel Neuhaus, Horst Bunke:
Self-Organizing Graph Graph Edit Distance. 83-94 - R. Ambauen, Stefan Fischer, Horst Bunke:
Graph Edit Distance with Node Splitting and Merging, and Its Application to Diatom Idenfication. 95-106
Graph Matching
- Barend J. van Wyk, Michaël A. van Wyk:
Orthonormal Kernel Kronecker Product Graph Matching. 107-117 - Christophe Irniger, Horst Bunke:
Theoretical Analysis and Experimental Comparison of Graph Matching Algorithms for Database Filtering. 118-129 - Donatello Conte, Corrado Guidobaldi, Carlo Sansone:
A Comparison of Three Maximum Common Subgraph Algorithms on a Large Database of Labeled Graphs. 130-141 - Paolo Fosser, Roland Glantz, Marco Locatelli, Marcello Pelillo:
Swap Strategies for Graph Matching. 142-153
Matrix Methods
- Antonio Robles-Kelly, Edwin R. Hancock:
Graph Matching Using Spectral Seriation and String Edit Distance. 154-165 - Roland Glantz, Marcello Pelillo:
Graph Polynomials, Principal Piovoting, and Maximum Independent Sets. 166-177 - Huaijun Qiu, Edwin R. Hancock:
Graph Partition for Matching. 178-189
Graph Clustering
- Bin Luo, Richard C. Wilson, Edwin R. Hancock:
Spectral Clustering of Graphs. 190-201 - Adam Schenker, Mark Last, Horst Bunke, Abraham Kandel:
Comparison of Distance Measures for Graph-Based Clustering of Documents. 202-213 - Jean-Michel Jolion:
Some Experiments on Clustering a Set of Strings. 214-224 - Adel Hlaoui, Shengrui Wang:
A New Median Graph Algorithm. 225-234 - Horst Bunke, Pasquale Foggia, Corrado Guidobaldi, Mario Vento:
Graph Clustering Using the Weighted Minimum Common Supergraph. 235-246 - Miguel Angel Lozano, Francisco Escolano:
ACM Attributed Graph Clustering for Learning Classes of Images. 247-258 - Brijnesh J. Jain, Fritz Wysotzki:
A Competitive Winner-Takes-All Architecture for Classification and Pattern Recognition of Structures. 259-270
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-18 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
