Zobrazeno 1 - 6
of 6
pro vyhledávání: '"shen, Binrui."'
Graph matching aims to find correspondences between two graphs. It is a fundamental task in pattern recognition. The classical spectral matching algorithm has time complexity $\mathcal{O}(n^4)$ and space complexity $\mathcal{O}(n^4)$, where $n$ is th
Externí odkaz:
http://arxiv.org/abs/2310.14701
Softassign is a pivotal method in graph matching and other learning tasks. Many softassign-based algorithms exhibit performance sensitivity to a parameter in the softassign. However, tuning the parameter is challenging and almost done empirically. Th
Externí odkaz:
http://arxiv.org/abs/2309.13855
This paper studies a unified framework for graph matching problems called the constrained gradient method. Popular algorithms within this framework include graduated assignment (GA), integer projected fixed-point method (IPFP), and doubly stochastic
Externí odkaz:
http://arxiv.org/abs/2208.08233
Publikováno v:
In Journal of Computational and Applied Mathematics 15 January 2025 454
Fabricating experimental pictures in research work is a serious academic misconduct, which should better be detected in the reviewing process. However, due to large number of submissions, the detection whether a picture is fabricated or reused is lab
Externí odkaz:
http://arxiv.org/abs/2002.03720
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.