منابع مشابه
Majorizing measures and proportional subsets of bounded orthonormal systems
We study some natural empirical processes determined by uniformly convex Banach spaces with modulus of convexity of power type 2. Results of this kind were extensively studied in a Hilbertian setting, and became an important tool for investigations, for example, of the behaviour of various random sets of vectors (as in [14, 15, 7, 16, 2, 6]). We then apply these results to address a problem of ...
متن کاملIdentification of Nonlinear Systems using Orthonormal Bases
In this paper, non iterative algorithms for the identification of (multivariable) nonlinear systems consisting of the interconnection of LTI systems and static nonlinearities are presented. The proposed algorithms are numerically robust, since they are based only on least squares estimation and singular value decomposition. Three different block-oriented nonlinear models are considered in this ...
متن کاملSmall subsets inherit sparse ε-regularity
In this paper we investigate the behaviour of subgraphs of sparse ε-regular bipartite graphs G = (V1 ∪ V2, E) with vanishing density d that are induced by small subsets of vertices. In particular, we show that, with overwhelming probability, a random set S ⊆ V1 of size s 1/d contains a subset S′ with |S′| ≥ (1 − ε′)|S| that induces together with V2 an ε′-regular bipartite graph of density (1 ± ...
متن کاملConsistent Subsets of Inconsistent Systems
A large knowledge system operating for a long time almost inevitably becomes \polluted" by wrong data that makes the system inconsistent. Despite this fact, a sizeable part of the system remains unpolluted, and retains useful information. It is widely adopted that a maximally consistent subset of a system (mc-subset) contains a sig-niicant portion of unpolluted data. So, determining mc-subsets ...
متن کاملApproximation Schemes for Independent Set and Sparse Subsets of Polygons
We present an (1+ε)-approximation algorithm with quasi-polynomial running time for computing the maximum weight independent set of polygons out of a given set of polygons in the plane (specifically, the running time is nO(poly(logn,1/ε))). Contrasting this, the best known polynomial time algorithm for the problem has an approximation ratio of nε. Surprisingly, we can extend the algorithm to the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1972
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1972-0301439-8