Search Results for author:
Found 1 papers, 0 papers with code
CURSOR: Scalable Mixed-Order Hypergraph Matching with CUR Decomposition
To achieve greater accuracy, hypergraph matching algorithms require exponential increases in computational resources.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
