相关论文: Approximation in C^N

This is a non-technical survey of a recent theory of valuations on manifolds constructed in math.MG/0503397, math.MG/0503399, math.MG/0509512, math.MG/0511171 and actually a guide to this series of articles. We review also some recent…

The paper presents new and known results on estimates of important linear and nonlinear approximation characteristics of generalized Wiener classes of functions of several variables in different metrics.

In this paper, a sample-based procedure for obtaining simple and computable approximations of chance-constrained sets is proposed. The procedure allows to control the complexity of the approximating set, by defining families of…

We present a procedure to approximate a plane contour by piecewise polynomial functions, depending on various parameters, such as degree, number of local patches, selection of knots. This procedure aims to be adopted to study how…

Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…

System modeling is a classical approach to ensure their reliability since it is suitable both for a formal verification and for software testing techniques. In the context of model-based testing an approach combining random testing and…

Survey sampling theory and methods are introduced. Sampling designs and estimation methods are carefully discussed as a textbook for survey sampling. Topics includes Horvitz-Thompson estimation, simple random sampling, stratified sampling,…

\emph{Approximation Theory} uses nicely-behaved subcategories to understand entire categories, just as projective modules are used to approximate arbitrary modules in classical homological algebra. We use set-theoretic \emph{elementary…

This is a survey on the ongoing development of a descriptive theory of represented spaces, which is intended as an extension of both classical and effective descriptive set theory to deal with both sets and functions between represented…

In statistical physics and information theory, although the exponent of the partition function is often of our primary interest, there are cases where one needs more detailed information. In this paper, we present a general framework to…

An approximation method is presented for probabilistic inference with continuous random variables. These problems can arise in many practical problems, in particular where there are "second order" probabilities. The approximation, based on…

In this tutorial, we will survey known results on the complexity of conjunctive query evaluation in different settings, ranging from Boolean queries over counting to more complex models like enumeration and direct access. A particular focus…

In this paper, we transfer the problem of measuring navigational complexity in topological spaces to the nearness theory. We investigate the most important component of this problem, the topological complexity number (denoted by TC), with…

The theory of computational complexity focuses on functions and, hence, studies programs whose interactive behavior is reduced to a simple question/answer pattern. We propose a broader theory whose ultimate goal is expressing and analyzing…

Machine learning models have become more and more complex in order to better approximate complex functions. Although fruitful in many domains, the added complexity has come at the cost of model interpretability. The once popular k-nearest…

The aim of this paper is to study the characteristics of a general method to produce a new approximation sequence from a given one, by using suitable convex combinations.

In this paper we first introduce the unified definition of the sharp constant that includes constants in three major problems of approximation theory, such as, inequalities for approximating elements, approximation of individual elements,…

The theory of abstract convexity, also known as convexity without linearity, is an extension of the classical convex analysis. There are a number of remarkable results, mostly concerning duality, and some numerical methods, however, this…

We survey the classical results of the Dirichlet Approximation Theorem.

We outline how modern likelihood theory, which provides essentially exact inferences in a variety of parametric statistical problems, may routinely be applied in practice. Although the likelihood procedures are based on analytical…