Results 11 to 20 of about 1,306 (257)
Open Set Domain Adaptation by Extreme Value Theory
2022 IEEE International Conference on Big Data (Big Data), 2022 Common domain adaptation techniques assume that the source domain and the target domain share an identical label space, which is problematic since when target samples are unlabeled we have no knowledge on whether the two domains share the same label space.
Yiming Xu, Diego Klabjan
openaire +2 more sources
Conditional Extreme Value Theory for Open Set Video Domain Adaptation [PDF]
ACM Multimedia Asia, 2021 With the advent of media streaming, video action recognition has become progressively important for various applications, yet at the high expense of requiring large-scale data labelling. To overcome the problem of expensive data labelling, domain adaptation techniques have been proposed that transfers knowledge from fully labelled data (i.e., source ...
Zhuoxiao Chen +2 more
openaire +3 more sources
Quantum correlations on the no-signaling boundary: self-testing and more [PDF]
Quantum, 2023 In device-independent quantum information, correlations between local measurement outcomes observed by spatially separated parties in a Bell test play a fundamental role. Even though it is long-known that the set of correlations allowed in quantum theory
Kai-Siang Chen +5 more
doaj +1 more source
A general 2-part Erdȍs-Ko-Rado theorem [PDF]
Opuscula Mathematica, 2017 A two-part extension of the famous Erdȍs-Ko-Rado Theorem is proved. The underlying set is partitioned into \(X_1\) and \(X_2\). Some positive integers \(k_i\), \(\ell_i\) (\(1\leq i\leq m\)) are given.
Gyula O. H. Katona
doaj +1 more source
Extremal set theory for the binomial norm [PDF]
Journal of Combinatorial Theory, Series A, 2020 Best possible bounds are established for families without s pairwise disjoint members and the more general problem for several families. The results are shown to apply several classical results.
openaire +2 more sources
Sunflowers and -intersecting families
AKCE International Journal of Graphs and Combinatorics, 2020 Let stand for the least number so that if is an arbitrary -uniform, -intersecting set system, where , and has more than elements, then contains a sunflower with petals. We give an upper bound for .
Gábor Hegedűs
doaj +1 more source
A note on the Ramsey numbers for theta graphs versus the wheel of order 5
AKCE International Journal of Graphs and Combinatorics, 2018 The study of exact values and bounds on the Ramsey numbers of graphs forms an important family of problems in the extremal graph theory. For a set of graphs S and a graph F , the Ramsey number R (S , F) is the smallest positive integer r such that for ...
Mohammed M.M. Jaradat +3 more
doaj +2 more sources
Conformal bootstrap deformations
Journal of High Energy Physics, 2022 We explore the space of extremal functionals in the conformal bootstrap. By recasting the bootstrap problem as a set of non-linear equations parameterized by the CFT data, we find an efficient algorithm for converging to the extremal solution ...
Nima Afkhami-Jeddi
doaj +1 more source
Journal of High Energy Physics, 2021 The positivity bounds, derived from the axiomatic principles of quantum field theory (QFT), constrain the signs of Wilson coefficients and their linear combinations in the Standard Model Effective Field Theory (SMEFT).
Kimiko Yamashita +2 more
doaj +1 more source
Freiman's Theorem in Finite Fields via Extremal Set Theory [PDF]
Combinatorics, Probability and Computing, 2009 Using various results from extremal set theory (interpreted in the language of additive combinatorics), we prove an asymptotically sharp version of Freiman's theorem in $\F_2^n$: if $A \subseteq \F_2^n$ is a set for which |A + A| ≤ K|A| then A is contained in a subspace of size $2^{2K + O(\sqrt{K}\log K)}|A|$; except for the $O(\sqrt{K} \log K)$ error,
Green, B, Tao, T
openaire +3 more sources