Results 31 to 40 of about 1,556,418 (219)
Matching relative Rota-Baxter algebras, matching dendriform algebras and their cohomologies [PDF]
arXiv, 2022 The notion of matching Rota-Baxter algebras was recently introduced by Gao, Guo and Zhang [{\em J. Algebra} 552 (2020) 134-170] motivated by the study of algebraic renormalization of regularity structures. The concept of matching Rota-Baxter algebras generalizes multiple integral operators with kernels.
arxiv
A note on minimal matching covered graphs [PDF]
Discrete Mathematics 306, (2006), pp. 452-455, 2007 A graph is called matching covered if for its every edge there is a maximum matching containing it. It is shown that minimal matching covered graphs contain a perfect matching.
arxiv +1 more source
Extractive Summarization as Text Matching [PDF]
Annual Meeting of the Association for Computational Linguistics, 2020 This paper creates a paradigm shift with regard to the way we build neural extractive summarization systems. Instead of following the commonly used framework of extracting sentences individually and modeling the relationship between sentences, we ...
Ming Zhong +5 more
semanticscholar +1 more source
Face recognition by elastic bunch graph matching
Proceedings of International Conference on Image Processing, 1997 We present a system for recognizing human faces from single images out of a large database containing one image per person. Faces are represented by labeled graphs, based on a Gabor wavelet transform. Image graphs of new faces are extracted by an elastic
Laurenz Wiskott +3 more
semanticscholar +1 more source
On the Coexistence of Stability and Incentive Compatibility in Fractional Matchings [PDF]
arXiv, 2020 Stable matchings have been studied extensively in social choice literature. The focus has been mostly on integral matchings, in which the nodes on the two sides are wholly matched. A fractional matching, which is a convex combination of integral matchings, is a natural extension of integral matchings.
arxiv
BMN: Boundary-Matching Network for Temporal Action Proposal Generation [PDF]
IEEE International Conference on Computer Vision, 2019 Temporal action proposal generation is an challenging and promising task which aims to locate temporal regions in real-world videos where action or event may occur.
Tianwei Lin +4 more
semanticscholar +1 more source
Education Match and Job Match [PDF]
The Review of Economics and Statistics, 1991 Using a new data set, this paper gives evidence in support of the intuitive notion that overqualified workers are less satisfied with their jobs and are more likely to quit. However, training time is inversely related to overqualification, which suggests why such seeming mismatches occur and may in fact be optimal. Copyright 1991 by MIT Press.
openaire +2 more sources
Minimal Envy and Popular Matchings [PDF]
European Journal of Operational Research, 296(3), 776-787 (2022), 2019 We study ex-post fairness in the object allocation problem where objects are valuable and commonly owned. A matching is fair from individual perspective if it has only inevitable envy towards agents who received most preferred objects -- minimal envy matching.
arxiv +1 more source
Theoretical Computer Science, 2021 In 2005, Goddard, Hedetniemi, Hedetniemi and Laskar [Generalized subgraph-restricted matchings in graphs, Discrete Mathematics, 293 (2005) 129 - 138] asked the computational complexity of determining the maximum cardinality of a matching whose vertex set induces a disconnected graph. In this paper we answer this question.
Guilherme C. M. Gomes +4 more
openaire +2 more sources