1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.DC2024
Accelerating Biclique Counting on GPU
Linshan Qiu, Zhonggen Li, Xiangyu Ke +2
Counting (p,q)-bicliques in bipartite graphs poses a foundational challenge with broad applications, from densest subgraph discovery in algorithmic research to personalized content…
cs.DC2024★ 1 cited
GPU-Accelerated Batch-Dynamic Subgraph Matching
Linshan Qiu, Lu Chen, Hailiang Jie +4
Subgraph matching has garnered increasing attention for its diverse real-world applications. Given the dynamic nature of real-world graphs, addressing evolving scenarios without in…
cs.CV2021★ 1 cited
ShufaNet: Classification method for calligraphers who have reached the professional level
Ge Yunfei, Diao Changyu, Li Min +3
The authenticity of calligraphy is significant but difficult task in the realm of art, where the key problem is the few-shot classification of calligraphy. We propose a novel metho…