Search Results for author:
Found 2 papers, 0 papers with code
Vertex nomination: The canonical sampling and the extended spectral nomination schemes
There are vertex nomination schemes in the literature, including the optimally precise canonical nomination scheme~$\mathcal{L}^C$ and the consistent spectral partitioning nomination scheme~$\mathcal{L}^P$.
Graph Matching: Relax at Your Own Risk
Indeed, experimental results illuminate and corroborate these theoretical findings, demonstrating that excellent results are achieved in both benchmark and real data problems by amalgamating the two approaches.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
