_ | subgraph | _ |
Adaptive | subgraph | Neural Network With Reinforced Critical Structure Mining |
AEDNet: Adaptive Edge-Deleting Network For | subgraph | Matching |
AG-Meta: Adaptive graph meta-learning via representation consistency over local | subgraph | s |
Algorithm for | subgraph | Isomorphism, An |
algorithm using length-r paths to approximate | subgraph | isomorphism, An |
Approximate MRF Inference Using Bounded Treewidth | subgraph | s |
Assessing the Impact of Digital Surface Models on Road Extraction in Suburban Areas by Region-based Road | subgraph | Extraction |
Bag-of-Paths Based Serialized | subgraph | Matching for Symbol Spotting in Line Drawings, A |
Bit-vector Algorithms for Binary Constraint Satisfaction and | subgraph | Isomorphism |
Bound for Non- | subgraph | Isomorphism, A |
Challenging the Time Complexity of Exact | subgraph | Isomorphism for Huge and Dense Graphs with VF3 |
Common Random | subgraph | Modeling Using Multiple Instance Learning |
decision tree approach to graph and | subgraph | isomorphism detection, A |
dense | subgraph | based algorithm for compact salient image region detection, A |
Dense | subgraph | mining with a mixed graph model |
Dense | subgraph | Partition of Positive Hypergraphs |
Depth-based | subgraph | convolutional auto-encoder for network representation learning |
Depth-based | subgraph | Convolutional Neural Networks |
Double | subgraph | Isomorphism Method for Matching LSI Chip Images |
Dynamic Channel-Aware | subgraph | Interactive Networks for Skeleton-Based Action Recognition |
Efficient Activity Detection in Untrimmed Video with Max- | subgraph | Search |
Efficient activity detection with max- | subgraph | search |
Efficient Approach for Mining Frequent | subgraph | s, An |
Efficient Least Common | subgraph | Algorithm for Video Indexing, An |
Efficient multi-target tracking via discovering dense | subgraph | s |
Efficient | subgraph | matching using topological node feature constraints |
Facial Expression Recognition on the High Aggregation | subgraph | s |
Factorizable Net: An Efficient | subgraph | -Based Framework for Scene Graph Generation |
Fast depth-based | subgraph | kernels for unattributed graphs |
Fast Detection of Dense | subgraph | s with Iterative Shrinking and Expansion |
Fast Jensen-Shannon | subgraph | Kernel, A |
fast scanning based message receiving method on four directed acyclic | subgraph | s, A |
Faster | subgraph | isomorphism detection by well-founded total order indexing |
Finding the best not the most: regularized loss minimization | subgraph | selection for graph classification |
Fingerprint Matching Using a Geometric | subgraph | Mining Approach |
From Bags to Graphs of Stereo | subgraph | s in Order to Predict Molecule'S Properties |
GEM++: A Tool for Solving Substitution-Tolerant | subgraph | Isomorphism |
generalization of the most common | subgraph | distance and its application to graph editing, A |
Generalized Sparse Learning of Linear Models Over the Complete | subgraph | Feature Set |
Generalized | subgraph | Preconditioners for Large-Scale Bundle Adjustment |
Generative | subgraph | Contrast for Self-Supervised Graph Representation Learning |
Global Registration of Multiview Unordered Forest Point Clouds Guided by Common | subgraph | s |
Graph Characterization by Counting Sink Star | subgraph | s |
Graph Classification Using Signal- | subgraph | s: Applications in Statistical Connectomics |
Graph Distance Metric Based on the Maximal Common | subgraph | , A |
graph distance metric combining maximum common | subgraph | and minimum common supergraph, A |
Graph Lattice Approach to Maintaining and Learning Dense Collections of | subgraph | s as Image Features, A |
Graph Lattice Approach to Maintaining Dense Collections of | subgraph | s as Image Features, A |
graph matching method and a graph matching distance based on | subgraph | assignments, A |
Graph Similarity-Based Maximum Stable | subgraph | Extraction of Information Topology From a Vehicular Network |
Histogram of dense | subgraph | s for image representation |
Hough Transform Technique for | subgraph | Isomorphism, A |
Identifying Coherent | subgraph | s In Dynamic Brain Networks |
Image Classification Using Frequent Approximate | subgraph | s |
Image Classification Using | subgraph | Histogram Representation |
Image Clustering Based on Frequent Approximate | subgraph | Mining |
Image Co-segmentation Using Maximum Common | subgraph | Matching and Region Co-growing |
Improving Graph Neural Network Expressivity via | subgraph | Isomorphism Counting |
Improving | subgraph | Recognition with Variational Graph Information Bottleneck |
Indexing All Rooted | subgraph | s of a Rooted Graph |
Indexing with Well-Founded Total Order for Faster | subgraph | Isomorphism Detection |
integer linear program for substitution-tolerant | subgraph | isomorphism and its use for symbol spotting in technical drawings, An |
Integration of dense | subgraph | finding with feature clustering for unsupervised feature selection |
Introducing VF3: A New Algorithm for | subgraph | Isomorphism |
LEGClust: A Clustering Algorithm Based on Layered Entropic | subgraph | s |
Locality-aware | subgraph | s for inductive link prediction in knowledge graphs |
Localized curvature-based combinatorial | subgraph | sampling for large-scale graphs |
Matched Filters for Noisy Induced | subgraph | Detection |
Maximal Prime | subgraph | Decomposition of Bayesian Networks |
Mean and maximum common | subgraph | of two graphs |
Median Graph Computation by Means of a Genetic Approach Based on Minimum Common Supergraph and Maximum Common | subgraph | |
Median graph: A new exact algorithm using a distance based on the maximum common | subgraph | |
Minimum cost | subgraph | matching using a binary linear program |
Model Matching in Robot Vision by | subgraph | Isomorphism |
Multi-class Graph Boosting with | subgraph | Sharing for Object Recognition |
Multi- | subgraph | matching for logo localization using genetic algorithm |
Neural-Network Approach for Solving the Maximal Common | subgraph | Problem |
New Algorithm for Error Tolerant | subgraph | Isomorphism Detection, A |
New Algorithm for | subgraph | Optimal Isomorphism, A |
New Product Graph Based Algorithm for | subgraph | Isomorphism, A |
new proposal for graph-based image classification using frequent approximate | subgraph | s, A |
Object Recognition Through Topo-Geometric Shape Models Using Error-Tolerant | subgraph | Isomorphisms |
On A Relation Between Graph Edit Distance and Maximum Common | subgraph | |
On Speeding up Frequent Approximate | subgraph | Mining |
On the Relation Between the Median and the Maximum Common | subgraph | of a Set of Graphs |
One-shot field spotting on colored forms using | subgraph | isomorphism |
Optimal local community detection in social networks based on density drop of | subgraph | s |
Outlier faces detector via efficient cohesive | subgraph | identification |
Probabilistic | subgraph | Matching Based on Convex Relaxation |
Processing Pictorial Queries with Multiple Instances Using Isomorphic | subgraph | s |
Product graph-based higher order contextual similarities for inexact | subgraph | matching |
Quantum-based | subgraph | convolutional neural networks |
Recognizing Objects in Cluttered Images Using | subgraph | Isomorphism |
Recognizing Predictive Substructures With | subgraph | Information Bottleneck |
Relational | subgraph | for Graph-based Path Prediction |
Sequential Monte Carlo for Maximum Weight | subgraph | s with Application to Solving Image Jigsaw Puzzles |
Spatiotemporal RDF Data Query Based on | subgraph | Matching |
| subgraph | and object context-masked network for scene graph generation |
| subgraph | decomposition for multi-target tracking |
| subgraph | Error-Correcting Isomorphisms for Syntatic Pattern Recognition |
| subgraph | Isomorphism Algorithm Using Resolution, A |
| subgraph | Isomorphism, Common Subgraphs, Subgraph Matching |
| subgraph | Isomorphism, Common Subgraphs, Subgraph Matching |
| subgraph | Isomorphism, Common Subgraphs, Subgraph Matching |
| subgraph | Isomorphism, Matching Relational Structures and Maximal Cliques |
| subgraph | learning for graph matching |
| subgraph | matching using compactness prior for robust feature correspondence |
| subgraph | Robustness of Complex Networks Under Attacks |
| subgraph | spotting in graph representations of comic book images |
| subgraph | Spotting through Explicit Graph Embedding: An Application to Content Spotting in Graphic Document Images |
Symbol Recognition by Error-Tolerant | subgraph | Matching between Region Adjacency Graphs |
System to Understand Hand-Drawn Floor-Plans Using | subgraph | Isomorphism and Hough Transform, A |
Top-k correlated | subgraph | query for data streams |
Topological features and iterative node elimination for speeding up | subgraph | isomorphism detection |
VF3-Light | subgraph | Isomorphism Algorithm: When Doing Less Is More Effective, The |
VF3-Light: A lightweight | subgraph | isomorphism algorithm and its experimental evaluation |
Video indexing and similarity retrieval by largest common | subgraph | detection using decision trees |
117 for subgraph