Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID9. GbRPR 2015: Beijing, China
- Cheng-Lin Liu, Bin Luo, Walter G. Kropatsch, Jian Cheng:
Graph-Based Representations in Pattern Recognition - 10th IAPR-TC-15 International Workshop, GbRPR 2015, Beijing, China, May 13-15, 2015. Proceedings. Lecture Notes in Computer Science 9069, Springer 2015, ISBN 978-3-319-18223-0
Graph-Based Representation
- Kaspar Riesen
, Miquel Ferrer, Andreas Fischer, Horst Bunke:
Approximation of Graph Edit Distance in Quadratic Time. 3-12 - Samuel de Sousa, Walter G. Kropatsch:
Data Graph Formulation as the Minimum-Weight Maximum-Entropy Problem. 13-22 - Cheng Ye, Richard C. Wilson, Edwin R. Hancock:
An Entropic Edge Assortativity Measure. 23-33 - Yanwei Cui, Laetitia Chapel, Sébastien Lefèvre:
A Subpath Kernel for Learning Hierarchical Image Representations. 34-43 - Zhihong Zhang, Jianbing Xiahou, Lu Bai, Edwin R. Hancock:
Coupled-Feature Hypergraph Representation for Feature Selection. 44-53 - Ines Janusch, Walter G. Kropatsch:
Reeb Graphs Through Local Binary Patterns. 54-63 - Rachid Hafiane, Luc Brun, Salvatore Tabbone:
Incremental Embedding Within a Dissimilarity-Based Framework. 64-73
Graph Matching
- Miquel Ferrer, Francesc Serratosa, Kaspar Riesen:
A First Step Towards Exact Graph Edit Distance Using Bipartite Graph Matching. 77-86 - Carlos Francisco Moreno-García, Francesc Serratosa, Xavier Cortés:
Consensus of Two Graph Correspondences Through a Generalisation of the Bipartite Graph Matching. 87-97 - William Jones, Aziem Chawdhary, Andy King:
Revisiting Volgenant-Jonker for Approximating Graph Edit Distance. 98-107 - He Zhang, Bin Du, Yanjiang Wang, Peng Ren:
A Hypergraph Matching Framework for Refining Multi-source Feature Correspondences. 108-117 - Kamel Madi, Hamida Seba, Hamamache Kheddouci, Charles-Edmond Bichot, Olivier Barge, Christine Chataigner, Remy Crassard, Emmanuelle Réganon, Emmanuelle Vila:
Kite Recognition by Means of Graph Matching. 118-127 - Julien Lerouge, Pierre Le Bodic, Pierre Héroux, Sébastien Adam:
GEM++: A Tool for Solving Substitution-Tolerant Subgraph Isomorphism. 128-137 - Zeina Abu-Aisheh, Romain Raveaux, Jean-Yves Ramel:
A Graph Database Repository and Performance Evaluation Metrics for Graph Edit Distance. 138-147 - Andreas Fischer, Seiichi Uchida, Volkmar Frinken, Kaspar Riesen, Horst Bunke:
Improving Hausdorff Edit Distance Using Structural Node Context. 148-157 - Haoyi Zhou, Xiao Bai, Jun Zhou, Haichuan Yang, Yun Liu:
Learning Graph Model for Different Dimensions Image Matching. 158-167 - Vincenzo Carletti, Pasquale Foggia, Mario Vento:
VF2 Plus: An Improved version of VF2 for Biological Graphs. 168-177 - Vincenzo Carletti, Pasquale Foggia, Mario Vento, Xiaoyi Jiang:
Report on the First Contest on Graph Matching Algorithms for Pattern Search in Biological Databases. 178-187 - Vincenzo Carletti, Benoit Gaüzère, Luc Brun, Mario Vento:
Approximate Graph Edit Distance Computation Combining Bipartite Matching and Exact Neighborhood Substructure Distance. 188-197 - Yusuf Osmanlioglu, Ali Shokoufandeh:
Multi-layer Tree Matching Using HSTs. 198-207 - Pau Riba, Josep Lladós, Alicia Fornés, Anjan Dutta:
Large-Scale Graph Indexing Using Binary Embeddings of Node Contexts. 208-217 - Bo Jiang, Jin Tang, Bin Luo:
Attributed Relational Graph Matching with Sparse Relaxation and Bistochastic Normalization. 218-227
Graph Clustering and Classification
- Xavier Cortés, Francesc Serratosa, Carlos Francisco Moreno-García:
On the Influence of Node Centralities on Graph Edit Distance for Graph Classification. 231-241 - Lixiang Xu, Jin Xie, Xiaofeng Wang, Bin Luo:
A Mixed Weisfeiler-Lehman Graph Kernel. 242-251 - Lu Bai, Luca Rossi, Peng Ren, Zhihong Zhang, Edwin R. Hancock:
A Quantum Jensen-Shannon Graph Kernel Using Discrete-Time Quantum Walks. 252-261 - Jian Hou, Chunshi Sha, Xu E, Qi Xia, Naiming Qi:
Density Based Cluster Extension and Dominant Sets Clustering. 262-271 - Xingxing Fan, Zhi Liu, Linwei Ye:
Salient Object Segmentation from Stereoscopic Images. 272-281 - Vijay N. Gangapure, Susmit Nanda, Ananda S. Chowdhury, Xiaoyi Jiang:
Causal Video Segmentation Using Superseeds and Graph Matching. 282-291 - R. Jothi, Sraban Kumar Mohanty, Aparajita Ojha:
Fast Minimum Spanning Tree Based Clustering Algorithms on Local Neighborhood Graph. 292-301
Graph-Based Applications
- Pierre-Anthony Grenier, Luc Brun, Didier Villemin:
From Bags to Graphs of Stereo Subgraphs in Order to Predict Molecule'S Properties. 305-314 - Cheng Ye, Andrea Torsello, Richard C. Wilson, Edwin R. Hancock:
Thermodynamics of Time Evolving Networks. 315-324 - Yanzhen Liu, Xiao Bai, Haichuan Yang, Zhou Jun, Zhihong Zhang:
Isometric Mapping Hashing. 325-334 - Francisco Escolano, Edwin R. Hancock, Miguel Angel Lozano:
Skeletal Graphs from Schrödinger Magnitude and Phase. 335-344 - Ehab Essa, Xianghua Xie, Jonathan-Lee Jones:
Graph Based Lymphatic Vessel Wall Localisation and Tracking. 345-354 - Thanh Nam Le, Muhammad Muzzamil Luqman, Jean-Christophe Burie, Jean-Marc Ogier:
A Comic Retrieval System Based on Multilayer Graph Representation and Graph Mining. 355-364 - Ni Liu, Georgy L. Gimel'farb, Patrice Delmas:
Learning High-Order Structures for Texture Retrieval. 365-374
a service of 
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-04-25 05:27 CEST 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:
