Search Results for author:
Found 2 papers, 0 papers with code
An Efficient Pruning Process with Locality Aware Exploration and Dynamic Graph Editing for Subgraph Matching
Subgraph matching is a NP-complete problem that extracts isomorphic embeddings of a query graph $q$ in a data graph $G$.
Exploiting Knowledge Distillation for Few-Shot Image Generation
The existing pipeline is first pretraining a source model (which contains a generator and a discriminator) on a large-scale dataset and finetuning it on a target domain with limited samples.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
