Results 21 to 30 of about 69 (69)
Consensus algorithms and the decomposition-separation theorem [PDF]
52nd IEEE Conference on Decision and Control, 2013 Convergence properties of time inhomogeneous Markov chain based discrete and continuous time linear consensus algorithms are analyzed. Provided that a so-called infinite jet flow property is satisfied by the underlying chains, necessary conditions for both consensus and multiple consensus are established.
Sadegh Bolouki, Roland P. MalhamƩ
openaire +2 more sources
Theorems on separability in Riemannian š¯‘›-space [PDF]
Proceedings of the American Mathematical Society, 1952 (2) ~~~~~V20 = ? (2) and consider separability in an n-space with Riemannian metric gij=0, where i$j. DEFINITION I.
Moon, Parry, Spencer, Domina Eberle
openaire +1 more source
An Imbedding Theorem for Separable Algebras [PDF]
Proceedings of the American Mathematical Society, 1973 Let S / R S/R
openaire +1 more source
A Transfer Theorem for the Separation Problem
CoRR, 2015 We investigate two problems for a class C of regular word languages. The C-membership problem asks for an algorithm to decide whether an input language belongs to C. The C-separation problem asks for an algorithm that, given as input two regular languages, decides whether there exists a third language in C containing the first language, while being ...
Thomas Place, Marc Zeitoun
openaire +2 more sources
Theorems on the existence of separating surfaces [PDF]
Discrete & Computational Geometry, 1991 Let R and G be finite sets in \(E^ d\). Kirchberger's theorem implies that the strict linear separability of R and G is determined by the separability of all subsets of up to \(d+2\) points of \(R\cup G\). This paper shows that under certain conditions, the linear separability of R and G is determined by the separability of significantly fewer than all
openaire +2 more sources
GENERALIZED STURM SEPARATION THEOREM
Demonstratio Mathematica, 2003 After recalling definitions and results about algebraic analysis from other articles by the author, a generalization of the Sturm separation theorem, when a right invertible operator has a kernel of arbitrary dimension, is proved. The paper concludes with an application to multiplicative symbols in Leibniz algebras.
openaire +1 more source
An upward measure separation theorem
Theoretical Computer Science, 1991 Let E denote the exponential time complexity class \(E=DTIME(2^{lin})\) and let ESPACE denote the exponential space complexity class \(ESPACE=DSPACE(2^{lin})\). Let BPP denote the bounded-error probabilistic polynomial time complexity class. Let P/Poly denote the nonuniform complexity class of all languages in P which have polynomial size circuits. The
openaire +2 more sources
Some Separation Theorems [PDF]
Proceedings of the National Academy of Sciences, 1927 openaire +2 more sources
On some separation and mapping theorems
Commentarii Mathematici Helvetici, 1955 openaire +1 more source