Displaying 21 – 40 of 92

Showing per page

Boundary of the union of rectangles in the plane

Václav Medek (1983)

Aplikace matematiky

Given n rectangles in a plane whose all sides belong to two perpendicular directions, an algorithm for the construction of the boundary of the union of those rectangles is shown in teh paper.

Countably convex G δ sets

Vladimir Fonf, Menachem Kojman (2001)

Fundamenta Mathematicae

We investigate countably convex G δ subsets of Banach spaces. A subset of a linear space is countably convex if it can be represented as a countable union of convex sets. A known sufficient condition for countable convexity of an arbitrary subset of a separable normed space is that it does not contain a semi-clique [9]. A semi-clique in a set S is a subset P ⊆ S so that for every x ∈ P and open neighborhood u of x there exists a finite set X ⊆ P ∩ u such that conv(X) ⊈ S. For closed sets this condition...

Densité et dimension

Patrick Assouad (1983)

Annales de l'institut Fourier

Une partie 𝒮 de 2 X est appelée une classe de Vapnik-Cervonenkis si la croissance de la fonction Δ 𝒮 : r Sup { | A | | A X , | A | = r } est polynomiale; ces classes se trouvent être utiles en Statistique et en Calcul des Probabilités (voir par exemple Vapnik, Cervonenkis [V.N. Vapnik, A.YA. Cervonenkis, Theor. Prob. Appl., 16 (1971), 264-280], Dudley [R.M. Dudley, Ann. of Prob., 6 (1978), 899-929]).Le présent travail est un essai de synthèse sur les classes de Vapnik-Cervonenkis. Mais il contient aussi beaucoup de résultats nouveaux,...

Currently displaying 21 – 40 of 92