Pages that link to "Item:Q3834090"
From MaRDI portal
The following pages link to An eigendecomposition approach to weighted graph matching problems (Q3834090):
Displaying 50 items.
- Unsupervised learning for graph matching (Q409138) (← links)
- Using local similarity measures to efficiently address approximate graph matching (Q496650) (← links)
- A distance measure for large graphs based on prime graphs (Q531270) (← links)
- Algorithm for cataloging topologies in the common information model (CIM) (Q552206) (← links)
- Quadratic nonnegative matrix factorization (Q663378) (← links)
- Fuzzy morphisms between graphs (Q698760) (← links)
- A survey of graph edit distance (Q710632) (← links)
- Recognition of structure similarities in proteins (Q732827) (← links)
- A Riemannian approach to graph embedding (Q856472) (← links)
- A spectral-multiplicity-tolerant approach to robust graph matching (Q888578) (← links)
- Graph matching by simplified convex-concave relaxation procedure (Q903552) (← links)
- A gradient-type algorithm optimizing the coupling between matrices (Q935392) (← links)
- Image categorization: Graph edit distance \(+\) edge direction histogram (Q936445) (← links)
- A study of graph spectra for comparing graphs and trees (Q937426) (← links)
- Machine learning problems from optimization perspective (Q989890) (← links)
- Graph matching using the interference of continuous-time quantum walks (Q1010111) (← links)
- Kronecker product graph matching. (Q1400491) (← links)
- An algorithm for weighted sub-graph matching based on gradient flows (Q1671710) (← links)
- A long trip in the charming world of graphs for pattern recognition (Q1677050) (← links)
- Approximation of graph edit distance based on Hausdorff matching (Q1677056) (← links)
- A quantum Jensen-Shannon graph kernel for unattributed graphs (Q1677057) (← links)
- Graph-based point drift: graph centrality on the registration of point-sets (Q1677064) (← links)
- On searching and indexing sequences of temporal intervals (Q1741320) (← links)
- Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles (Q1799950) (← links)
- Spatial pattern discovery by learning a probabilistic parametric model from multiple attributed relational graphs (Q1827818) (← links)
- Spectral correspondence for point pattern matching (Q1856662) (← links)
- A polynomial transform for matching pairs of weighted graphs (Q1903232) (← links)
- Shape-based object detection via boundary structure segmentation (Q1931604) (← links)
- A quotient space formulation for generative statistical analysis of graphical data (Q2036213) (← links)
- Image matching from handcrafted to deep features: a survey (Q2056423) (← links)
- A new matching algorithm between trees of shapes and its application to brain tumor segmentation (Q2061786) (← links)
- Tail bounds for gaps between eigenvalues of sparse random matrices (Q2076604) (← links)
- Graph comparison via nonlinear quantum search (Q2105947) (← links)
- Statistical shape analysis of brain arterial networks (BAN) (Q2154222) (← links)
- Efficient feature matching via nonnegative orthogonal relaxation (Q2193822) (← links)
- Spectral graph features for the classification of graphs and graph sequences (Q2259697) (← links)
- Generalized median graphs and applications (Q2271138) (← links)
- Matching the LBO eigenspace of non-rigid shapes via high order statistics (Q2345055) (← links)
- Graph simplification and matching using commute times (Q2373488) (← links)
- A dynamical systems approach to weighted graph matching (Q2377984) (← links)
- Statistical graph space analysis (Q2417832) (← links)
- A fast projected fixed-point algorithm for large graph matching (Q2417841) (← links)
- Heat kernel embeddings, differential geometry and graph structure (Q2422513) (← links)
- Graph similarity scoring and matching (Q2472827) (← links)
- Correspondence matching using kernel principal components analysis and label consistency constraints (Q2499110) (← links)
- A spectral approach to learning structural variations in graphs (Q2499134) (← links)
- Attributed relational graph matching based on the nested assignment structure (Q2654263) (← links)
- Measuring similarity between connected graphs: the role of induced subgraphs and complementarity eigenvalues (Q2657102) (← links)
- Quantum walk inspired algorithm for graph similarity and isomorphism (Q2681642) (← links)
- \texttt{Procrustes}: a python library to find transformations that maximize the similarity between matrices (Q2695590) (← links)
