default search action
11. GbRPR 2017: Anacapri, Italy
- Pasquale Foggia, Cheng-Lin Liu, Mario Vento:
Graph-Based Representations in Pattern Recognition - 11th IAPR-TC-15 International Workshop, GbRPR 2017, Anacapri, Italy, May 16-18, 2017, Proceedings. Lecture Notes in Computer Science 10310, 2017, ISBN 978-3-319-58960-2
Image and Shape Analysis
- Zhouqin He, Bo Jiang, Yun Xiao, Chris H. Q. Ding, Bin Luo:
Saliency Detection via A Graph Based Diffusion Model. 3-12 - Francisco Escolano, Manuel Curado, Silvia Biasotti, Edwin R. Hancock:
Shape Simplification Through Graph Sparsification. 13-22 - Barbara Di Fabio, Claudia Landi:
Reeb Graphs of Piecewise Linear Functions. 23-35
Learning and Graph Kernels
- Sylvain Takerkart, Gottfried Berton, Nicole Malfait, François-Xavier Dupé:
Learning from Diffusion-Weighted Magnetic Resonance Images Using Graph Kernels. 39-48 - Romain Raveaux, Maxime Martineau, Donatello Conte, Gilles Venturini:
Learning Graph Matching with a Graph-Based Perceptron in a Classification Context. 49-58 - Lu Bai, Luca Rossi, Lixin Cui, Edwin R. Hancock:
A Nested Alignment Graph Kernel Through the Dynamic Time Warping Framework. 59-69
Graph Applications
- Dominik Drees, Aaron Scherzinger, Xiaoyi Jiang:
GERoMe - A Novel Graph Extraction Robustness Measure. 73-82 - Michael Stauffer, Andreas Fischer, Kaspar Riesen:
Speeding-Up Graph-Based Keyword Spotting in Historical Handwritten Documents. 83-93 - Jianjia Wang, Richard C. Wilson, Edwin R. Hancock:
Detecting Alzheimer's Disease Using Directed Graphs. 94-104
Graph Matching
- Pau Riba, Josep Lladós, Alicia Fornés:
Error-Tolerant Coarse-to-Fine Matching Model for Hierarchical Graphs. 107-117 - Sébastien Bougleux, Benoit Gaüzère, Luc Brun:
A Hungarian Algorithm for Error-Correcting Graph Matching. 118-127 - Vincenzo Carletti, Pasquale Foggia, Alessia Saggese, Mario Vento:
Introducing VF3: A New Algorithm for Subgraph Isomorphism. 128-139
Large Graphs and Social Networks
- Pep Santacruz, Shaima Algabli, Francesc Serratosa:
Node Matching Computation Between Two Large Graphs in Linear Computational Cost. 143-153 - Luca Rossi, Andrea Torsello:
Measuring Vertex Centrality Using the Holevo Quantity. 154-164 - Marco Fiorucci, Alessandro Torcinovich, Manuel Curado, Francisco Escolano, Marcello Pelillo:
On the Interplay Between Strong Regularity and Graph Densification. 165-174
Mining and Clustering
- Romain Deville, Élisa Fromont, Baptiste Jeudy, Christine Solnon:
Mining Frequent Patterns in 2D+t Grid Graphs for Cellular Automata Analysis. 177-186 - Jian Hou, Hongxia Cui:
Density Normalization in Density Peak Based Clustering. 187-196 - Zeina Abu-Aisheh, Romain Raveaux, Jean-Yves Ramel:
Fast Nearest Neighbors Search in Graph Space Based on a Branch-and-Bound Strategy. 197-207
Graph Edit Distance
- David B. Blumenthal, Johann Gamper:
Exact Computation of Graph Edit Distance for Uniform and Non-uniform Metric Edit Costs. 211-221 - Kaspar Riesen, Andreas Fischer, Horst Bunke:
Improved Graph Edit Distance Approximation with Simulated Annealing. 222-231 - Carlos Francisco Moreno-García, Francesc Serratosa, Xiaoyi Jiang:
An Edit Distance Between Graph Correspondences. 232-241 - Michael Stauffer, Thomas Tschachtli, Andreas Fischer, Kaspar Riesen:
A Survey on Applications of Bipartite Graph Edit Distance. 242-252
Graphs and Information Theory
- Jianjia Wang, Richard C. Wilson, Edwin R. Hancock:
Minimising Entropy Changes in Dynamic Network Evolution. 255-265 - Michele Schiavinato, Andrea Torsello:
Synchronization Over the Birkhoff Polytope for Multi-graph Matching. 266-275 - Lixin Cui, Yuhang Jiao, Lu Bai, Luca Rossi, Edwin R. Hancock:
Adaptive Feature Selection Based on the Most Informative Graph-Based Features. 276-287
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.