Results 21 to 30 of about 1,433,317 (315)
A Siamese Transformer Network for Zero-Shot Ancient Coin Classification
Journal of Imaging, 2023 Ancient numismatics, the study of ancient coins, has in recent years become an attractive domain for the application of computer vision and machine learning.
Zhongliang Guo +4 more
doaj +1 more source
On Matchings in Hypergraphs [PDF]
The Electronic Journal of Combinatorics, 2012 We show that if the largest matching in a $k$-uniform hypergraph $G$ on $n$ vertices has precisely $s$ edges, and $n>2k^2s/\log k$, then $H$ has at most $\binom n k - \binom {n-s} k $ edges and this upper bound is achieved only for hypergraphs in which the set of edges consists of all $k$-subsets which intersect a given set of $s$ vertices.
Peter Frankl +2 more
openaire +3 more sources
Acta Universitatis Agriculturae et Silviculturae Mendelianae Brunensis, 2014 This study aims to estimate the gender pay gap, cleansed at least partially of the effect of intra-household specialization on productivity. The estimate is based on EU-SILC data for 19 member countries of the European Union.
Veronika Hedija
doaj +1 more source
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 +2 more sources
Near―perfect non-crossing harmonic matchings in randomly labeled points on a circle [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Consider a set $S$ of points in the plane in convex position, where each point has an integer label from $\{0,1,\ldots,n-1\}$. This naturally induces a labeling of the edges: each edge $(i,j)$ is assigned label $i+j$, modulo $n$.
József Balogh +2 more
doaj +1 more source
Entropy, 2023 Fully pairing all elements of a set while attempting to maximize the total benefit is a combinatorically difficult problem. Such pairing problems naturally appear in various situations in science, technology, economics, and other fields.
Naoki Fujita +6 more
doaj +1 more source
Stability and Nash implementation in matching markets with couples [PDF]
, 2008 Haake C-J, Klaus B. Stability and Nash implementation in matching markets with couples. Working Papers. Institute of Mathematical Economics. Vol 399. Bielefeld: Universität Bielefeld; 2008.We consider two-sided matching markets with couples.
Klaus, B.E. +5 more
core +1 more source
Designs of Branch-Line Couplers by Considering the Parasitic Effects of P-I-N Diodes
IEEE Access, 2020 Branch-line couplers (BLCs) are commonly used in the wireless systems. To achieve reconfigurable applications, switchable BLCs with p-i-n diodes can be used.
Pu-Hua Deng +6 more
doaj +1 more source
Patterns in matchings and rook placements [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Extending the notion of pattern avoidance in permutations, we study matchings and set partitions whose arc diagram representation avoids a given configuration of three arcs.
Jonathan Bloom, Sergi Elizalde
doaj +1 more source
IEEE Access, 2018 Software defined networking (SDN) realizes the full decoupling between control plane and data plane, and it could effectively simplify network management and promote network innovation.
Tao Hu +4 more
doaj +1 more source