Results 201 to 210 of about 10,205 (230)
Hypergraph matching via game-theoretic hypergraph clustering
Pattern Recognition, 2022 Feature matching is used to build correspondences between features in the model and test images. As the extension of graph matching, hypergraph matching is able to encode rich invariance between feature tuples and improve matching accuracy.
Jian Hou +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The matching polynomials of hypergraphs and weighted hypergraphs
Discrete Mathematics, Algorithms and Applications, 2022Let [Formula: see text] be the set of the connected [Formula: see text]-uniform linear hypergraphs with [Formula: see text] vertices, where [Formula: see text]. The matching polynomial of a hypergraph [Formula: see text] is denoted by [Formula: see text], where [Formula: see text]. Several properties on the roots of [Formula: see text] are derived. We
Jia-Wen Yang, Wen-Huan Wang
openaire +2 more sources
Mathematical Programming, 1997
We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning hypertrees so generalizing the spanning tree of a standard graph, and show that, like in the standard and in the generalized minimum cost flow problems, a correspondence exists between bases and spanning hypertrees. Then, we show that, like for the network
CAMBINI, RICCARDO +2 more
openaire +4 more sources
We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning hypertrees so generalizing the spanning tree of a standard graph, and show that, like in the standard and in the generalized minimum cost flow problems, a correspondence exists between bases and spanning hypertrees. Then, we show that, like for the network
CAMBINI, RICCARDO +2 more
openaire +4 more sources
2016
We introduce sequence hypergraphs by extending the concept of a directed edge (from simple directed graphs) to hypergraphs. Specifically, every hyperedge of a sequence hypergraph is defined as a sequence of vertices (imagine it as a directed path). Note that this differs substantially from the standard definition of directed hypergraphs.
Böhmová, Katerina +4 more
openaire +5 more sources
We introduce sequence hypergraphs by extending the concept of a directed edge (from simple directed graphs) to hypergraphs. Specifically, every hyperedge of a sequence hypergraph is defined as a sequence of vertices (imagine it as a directed path). Note that this differs substantially from the standard definition of directed hypergraphs.
Böhmová, Katerina +4 more
openaire +5 more sources
SIAM Journal on Discrete Mathematics, 1996
A subsystem of an inconsistent set of inequalities is an irreducibly inconsistent subsystem (IIS) if it is inconsistent and if it has no inconsistent proper subsystem. Each IIS can be considered the edge of a hypergraph. The paper presents several properties of this special class of hypergraphs (IIS-hypergraphs).
openaire +1 more source
A subsystem of an inconsistent set of inequalities is an irreducibly inconsistent subsystem (IIS) if it is inconsistent and if it has no inconsistent proper subsystem. Each IIS can be considered the edge of a hypergraph. The paper presents several properties of this special class of hypergraphs (IIS-hypergraphs).
openaire +1 more source
Hypergraph isomorphism using association hypergraphs
Pattern Recognition Letters, 2019Abstract Association graphs represent a classical tool to deal with the graph matching problem and recently the idea has been generalized to the case of hypergraphs. In this article, the potential of this approach is explored. The proposed framework uses a class of dynamical systems derived from the Baum-Eagon inequality in order to find the maximum (
Giulia Sandi +2 more
openaire +1 more source
The Quarterly Journal of Mathematics, 1986
There is proved that every \((h+1)\)-uniform hypergraph H with \(\chi (H)=k\geq 3\) contains a cycle of length at least k and deduced the asymptotic behaviour of the maximum number of k-colourings in the class of all \((h+1)\)-hypergraphs of order n with \(\chi (H)=k\).
openaire +1 more source
There is proved that every \((h+1)\)-uniform hypergraph H with \(\chi (H)=k\geq 3\) contains a cycle of length at least k and deduced the asymptotic behaviour of the maximum number of k-colourings in the class of all \((h+1)\)-hypergraphs of order n with \(\chi (H)=k\).
openaire +1 more source
Hypergraph Neural Networks for Hypergraph Matching
2021 IEEE/CVF International Conference on Computer Vision (ICCV), 2021Xiaowei Liao, Yong Xu 0007, Haibin Ling
openaire +1 more source
Hypergraph Learning: Methods and Practices
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2021Yue Gao, Zizhao Zhang, Xibin Zhao
exaly
Clustering ensemble via structured hypergraph learning
Information Fusion, 2022Peng Zhou, Liang Du, Xuejun Li
exaly