Pages that link to "Item:Q3003437"
From MaRDI portal
The following pages link to Graph-Based Representations in Pattern Recognition (Q3003437):
Displayed 50 items.
- Cell AT-Models for Digital Volumes (Q3637712) (← links)
- A One Hour Trip in the World of Graphs, Looking at the Papers of the Last Ten Years (Q4922141) (← links)
- A Unified Framework for Strengthening Topological Node Features and Its Application to Subgraph Isomorphism Detection (Q4922142) (← links)
- On the Complexity of Submap Isomorphism (Q4922143) (← links)
- Flooding Edge Weighted Graphs (Q4922144) (← links)
- Graph Matching with Nonnegative Sparse Model (Q4922145) (← links)
- TurboTensors for Entropic Image Comparison (Q4922146) (← links)
- Active-Learning Query Strategies Applied to Select a Graph Node Given a Graph Labelling (Q4922147) (← links)
- GMTE: A Tool for Graph Transformation and Exact/Inexact Graph Matching (Q4922149) (← links)
- A Comparison of Explicit and Implicit Graph Embedding Methods for Pattern Recognition (Q4922151) (← links)
- Adjunctions on the Lattice of Dendrograms (Q4922152) (← links)
- A Continuous-Time Quantum Walk Kernel for Unattributed Graphs (Q4922153) (← links)
- Relevant Cycle Hypergraph Representation for Molecules (Q4922154) (← links)
- A Quantum Jensen-Shannon Graph Kernel Using the Continuous-Time Quantum Walk (Q4922155) (← links)
- Treelet Kernel Incorporating Chiral Information (Q4922156) (← links)
- A Novel Software Toolkit for Graph Edit Distance Computation (Q4922158) (← links)
- Map Edit Distance vs. Graph Edit Distance for Matching Images (Q4922159) (← links)
- An Algorithm for Maximum Common Subgraph of Planar Triangulation Graphs (Q4922160) (← links)
- Graph Characteristics from the Schrödinger Operator (Q4922161) (← links)
- Persistent Homology in Image Processing (Q4922162) (← links)
- Towards Minimal Barcodes (Q4922163) (← links)
- A Fast Matching Algorithm for Graph-Based Handwriting Recognition (Q4922164) (← links)
- On the Evaluation of Graph Centrality for Shape Matching (Q4922165) (← links)
- Shape Recognition as a Constraint Satisfaction Problem (Q4922166) (← links)
- Gaussian Wave Packet on a Graph (Q4922167) (← links)
- Exact Computation of Median Surfaces Using Optimal 3D Graph Search (Q4922168) (← links)
- Estimation of Distribution Algorithm for the Max-Cut Problem (Q4922169) (← links)
- Saliency Detection via A Graph Based Diffusion Model (Q5082140) (← links)
- Shape Simplification Through Graph Sparsification (Q5082141) (← links)
- Reeb Graphs of Piecewise Linear Functions (Q5082142) (← links)
- A Nested Alignment Graph Kernel Through the Dynamic Time Warping Framework (Q5082143) (← links)
- GERoMe – A Novel Graph Extraction Robustness Measure (Q5082145) (← links)
- Node Matching Computation Between Two Large Graphs in Linear Computational Cost (Q5082148) (← links)
- Measuring Vertex Centrality Using the Holevo Quantity (Q5082149) (← links)
- On the Interplay Between Strong Regularity and Graph Densification (Q5082152) (← links)
- Mining Frequent Patterns in 2D+t Grid Graphs for Cellular Automata Analysis (Q5082154) (← links)
- Fast Nearest Neighbors Search in Graph Space Based on a Branch-and-Bound Strategy (Q5082156) (← links)
- Exact Computation of Graph Edit Distance for Uniform and Non-uniform Metric Edit Costs (Q5082158) (← links)
- Improved Graph Edit Distance Approximation with Simulated Annealing (Q5082159) (← links)
- An Edit Distance Between Graph Correspondences (Q5082160) (← links)
- Minimising Entropy Changes in Dynamic Network Evolution (Q5082162) (← links)
- Synchronization Over the Birkhoff Polytope for Multi-graph Matching (Q5082163) (← links)
- Adaptive Feature Selection Based on the Most Informative Graph-Based Features (Q5082164) (← links)
- Bipartite Graph Matching for Computing the Edit Distance of Graphs (Q5325713) (← links)
- Matching of Tree Structures for Registration of Medical Images (Q5325715) (← links)
- Graph Based Shapes Representation and Recognition (Q5325717) (← links)
- A Continuous-Based Approach for Partial Clique Enumeration (Q5325718) (← links)
- A Bound for Non-subgraph Isomorphism (Q5325719) (← links)
- A Correspondence Measure for Graph Matching Using the Discrete Quantum Walk (Q5325720) (← links)
- A Quadratic Programming Approach to the Graph Edit Distance Problem (Q5325721) (← links)