Qixuan Zheng

CURSOR: Scalable Mixed-Order Hypergraph Matching with CUR Decomposition

To achieve greater accuracy hypergraph matching algorithms require exponential increases in computational resources. Recent kd-tree-based approximate nearest neighbor (ANN) methods despite the sparsity of their compatibility tensor still require exhaustive calculations for large-scale graph matching…