17 citations · 24 across the 7 of their papers we have counts for
7 papers
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…
Fast and Efficient Parallel Breadth-First Search with Power-law Graph Transformation
Zite Jiang, Tao Liu, Shuai Zhang +3
In the big data era, graph computing is widely used to exploit the hidden value in real-world graphs in various scenarios such as social networks, knowledge graphs, web searching,…
An Efficient and Balanced Graph Partition Algorithm for the Subgraph-Centric Programming Model on Large-scale Power-law Graphs
Shuai Zhang, Zite Jiang, Xingzhong Hou +3
The subgraph-centric programming model is a promising approach and has been applied in many state-of-the-art distributed graph computing frameworks. However, traditional graph part…
Improving the Performance of Stochastic Local Search for Maximum Vertex Weight Clique Problem Using Programming by Optimization
Yi Chu, Chuan Luo, Holger H. Hoos +2
The maximum vertex weight clique problem (MVWCP) is an important generalization of the maximum clique problem (MCP) that has a wide range of real-world applications. In situations…
ATSFFT: A Novel Sparse Fast Fourier Transform Enabled With Sparsity Detection
Sheng Shi, Runkai Yang, Haihang You
The Fast Fourier Transform(FFT) is a classic signal processing algorithm that is utilized in a wide range of applications. For image processing, FFT computes on every pixel's value…
Utilizing the Instability in Weakly Supervised Object Detection
Yan Gao, Boxiao Liu, Nan Guo +4
Weakly supervised object detection (WSOD) focuses on training object detector with only image-level annotations, and is challenging due to the gap between the supervision and the o…