Results 11 to 20 of about 1,556,418 (219)
Journal of Graph Algorithms and Applications, 2021 A matching is compatible to two or more labeled point sets of size $n$ with labels $\{1,\dots,n\}$ if its straight-line drawing on each of these point sets is crossing-free. We study the maximum number of edges in a matching compatible to two or more labeled point sets in general position in the plane.
Oswin Aichholzer +7 more
openaire +3 more sources
Matching with Externalities [PDF]
Proceedings of the The Third Conference on Auctions, Market Mechanisms and Their Applications, 2014 AbstractWe incorporate externalities into the stable matching theory of two-sided markets. Extending the classical substitutes condition to markets with externalities, we establish that stable matchings exist when agent choices satisfy substitutability.
Pycia, Marek, Yenmez, M Bumin
openaire +5 more sources
Property Matching and Weighted Matching [PDF]
Theoretical Computer Science, 2006 AbstractIn many pattern matching applications the text has some properties attached to its various parts. Pattern Matching with Properties (Property Matching, for short), involves a string matching between the pattern and the text, and the requirement that the text part satisfies some property.
Amir, A +4 more
openaire +3 more sources
Semantic Matching with S-Match [PDF]
, 2009 We view matching as an operation that takes two graph-like structures (e.g., lightweight ontologies) and produces an alignment between the nodes of these graphs that correspond semantically to each other. Semantic matching is based on two ideas: (i) we discover an alignment by computing semantic relations (e.g., equivalence, more general); (ii) we ...
Shvaiko, Pavel +2 more
openaire +3 more sources
Shape Matching and Object Recognition Using Shape Contexts
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2002 We present a novel approach to measuring similarity between shapes and exploit it for object recognition. In our framework, the measurement of similarity is preceded by: (1) solving for correspondences between points on the two shapes; (2) using the ...
Serge J. Belongie +2 more
semanticscholar +1 more source
Attention Concatenation Volume for Accurate and Efficient Stereo Matching [PDF]
Computer Vision and Pattern Recognition, 2022 Stereo matching is a fundamental building block for many vision and robotics applications. An informative and concise cost volume representation is vital for stereo matching of high accuracy and efficiency.
Gangwei Xu +3 more
semanticscholar +1 more source
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
IEEE Transactions on Information Theory, 2007 This paper demonstrates theoretically and empirically that a greedy algorithm called orthogonal matching pursuit (OMP) can reliably recover a signal with m nonzero entries in dimension d given O(m ln d) random linear measurements of that signal.
J. Tropp, Anna C. Gilbert
semanticscholar +1 more source
, 2001 In this paper we give a new simpler and uniform presentation of the rewriting calculus also called RHO-calculus. In addition to its simplicity, this reformulation explicitly allows us to encode complex structures such as lists, sets, and objects. We provide extensive examples of calculus use and we focus on its properties and its ability to represent ...
Cirstea, Horatiu +2 more
openaire +6 more sources
Some Practical Guidance for the Implementation of Propensity Score Matching
Social Science Research Network, 2005 Propensity Score Matching (PSM) has become a popular approach to estimate causal treatment effects. It is widely applied when evaluating labour market policies, but empirical examples can be found in very diverse fields of study.
Marco Caliendo, Sabine Kopeinig
semanticscholar +1 more source
Bioinform., 2007 MOTIVATION Clustering of individuals into populations on the basis of multilocus genotypes is informative in a variety of settings. In population-genetic clustering algorithms, such as BAPS, STRUCTURE and TESS, individual multilocus genotypes are ...
M. Jakobsson, N. Rosenberg
semanticscholar +1 more source