Results 271 to 280 of about 2,891,219 (304)
Some of the next articles are maybe not open access.
Combinatorica, 1993
Let \(S\) denote a set of \(n\) points in the plane, no 3 collinear. With \(a\), \(b\in S\) let \(w(a,b)=\) the number of points of \(S\) lying to the right of the line through \(a\) and \(b\) directed from \(a\) to \(b\). Let \(f_ k=f_ k(S)\) denote the number of pairs \((a,b)\) for which \(w(a,b)=k\), and let \(h_ r=h_ r(S)\) denote the expected ...
openaire +1 more source
Let \(S\) denote a set of \(n\) points in the plane, no 3 collinear. With \(a\), \(b\in S\) let \(w(a,b)=\) the number of points of \(S\) lying to the right of the line through \(a\) and \(b\) directed from \(a\) to \(b\). Let \(f_ k=f_ k(S)\) denote the number of pairs \((a,b)\) for which \(w(a,b)=k\), and let \(h_ r=h_ r(S)\) denote the expected ...
openaire +1 more source
On a Class of Random Variational Inequalities on Random Sets
Numerical Functional Analysis and Optimization, 2006We study a class of random variational inequalities on random sets and give measurability, existence, and uniqueness results in a Hilbert space setting. In the special case where the random and the deterministic variables are separated, we present a discretization technique based on averaging and truncation, prove a Mosco convergence result for the ...
GWINNER J, RACITI, Fabio
openaire +1 more source
Random Sets in Subrecursive Hierarchies
Journal of the ACM, 1969Successive modifications of Church's definition of a random sequence are considered in terms of their relative position in the Ritchie hierarchy of Kalmar elementary functions. A general result is derived governing the classification of Church random sequences in subrecursive hierarchies which include the elementary functions, such as the Grzegorczyk ...
openaire +3 more sources
Relative Randomness for Martin-Löf Random Sets
2012Let Γ be a set of functions on the natural numbers. We introduce a new randomness notion called semi Γ-randomness, which is associated with a Γ-indexed test. Fix a computable sequence {Gn}n∈ω of all c.e. open sets. For any f∈Γ, {Gf(n)}n∈ω is called a Γ-indexed test if μ(Gf(n))≤2−n for all n.
NingNing Peng +3 more
openaire +2 more sources
Random Sets and Random Functions
2017A random set is a multivalued measurable function defined on a probability space. If this multivalued function depends on the second argument (e.g., time or space), then random processes of sets (set-valued processes or random multivalued functions) appear.
openaire +1 more source
Random forest explainability using counterfactual sets
Information Fusion, 2020Isaac Martin De Diego +2 more
exaly
Strong Law of Large Numbers for Banach Space Valued Random Sets
Annals of Probability, 1983Dan Ralescu
exaly
An Introduction to Random Sets; Theory of Random Sets
Journal of the American Statistical Association, 2008openaire +1 more source
Convergence in distribution for level-continuous fuzzy random sets
Fuzzy Sets and Systems, 2006Yun Kyong Kim
exaly