Search Results for author:
Found 2 papers, 2 papers with code
GMTR: Graph Matching Transformers
Meanwhile, on Pascal VOC, QueryTrans improves the accuracy of NGMv2 from $80. 1\%$ to $\mathbf{83. 3\%}$, and BBGM from $79. 0\%$ to $\mathbf{84. 5\%}$.
Ranked #1 on
Graph Matching
on PASCAL VOC
(matching accuracy metric)
G4SATBench: Benchmarking and Advancing SAT Solving with Graph Neural Networks
Graph neural networks (GNNs) have recently emerged as a promising approach for solving the Boolean Satisfiability Problem (SAT), offering potential alternatives to traditional backtracking or local search SAT solvers.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
