17 citations · 29 across the 10 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.IR2021★ 2 cited
An Efficient Pruning Process with Locality Aware Exploration and Dynamic Graph Editing for Subgraph Matching
Zite Jiang, Boxiao Liu, Shuai Zhang +3
Subgraph matching is a NP-complete problem that extracts isomorphic embeddings of a query graph in a data graph . In this paper, we present a framework with three components…
cs.LG2021★ 5 cited
FNAS: Uncertainty-Aware Fast Neural Architecture Search
Jihao Liu, Ming Zhang, Yangting Sun +4
Reinforcement learning (RL)-based neural architecture search (NAS) generally guarantees better convergence yet suffers from the requirement of huge computational resources compared…