Results 301 to 310 of about 632,681 (338)
Some of the next articles are maybe not open access.

Stochastic Weighted Matching: (1-ϵ) Approximation

2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020
Let $G=(V, E)$ be a given edge-weighted graph and let its {\em realization} $\mathcal{G}$ be a random subgraph of $G$ that includes each edge $e \in E$ independently with probability $p$. In the {\em stochastic matching} problem, the goal is to pick a sparse subgraph $Q$ of $G$ without knowing the realization $\mathcal{G}$, such that the maximum weight
Behnezhad, Soheil, Derakhshan, Mahsa
openaire   +1 more source

Nonlinear Approximation and Muckenhoupt Weights

Constructive Approximation, 2006
In the general atomic setting of an unconditional basis in a (quasi-) Banach space, we show that representing the spaces of m-terms approximation as Lorentz spaces is equivalent to the verification of two inequalities (Jackson and Bernstein), and that the validity of these two properties is equivalent to the Temlyakov property. The proof is very direct
Kerkyacharian, G., Picard, D.
openaire   +2 more sources

Weighted polynomial approximation with Freud weights

Constructive Approximation, 1994
The authors have shown that if \(w(x)= \exp(-| x|^ \lambda)\) and \(I_ \lambda\) be the support of an external measure associated with it then (i) for \(\lambda= 1\) for every continuous \(f\) that vanishes outside \(I_ \lambda\) there are polynomials \(P_ n\) of degree of most \(n\) such that \(w^ n P_ n\) uniformly tends to \(f\), (ii) for \(0 ...
Lubinsky, Doron S., Totik, Vilmos
openaire   +1 more source

Weighted Polynomial Approximations

2001
In this chapter, we establish the existence of weighted polynomial approximations that are a prerequisite to the estimates and asymptotics in subsequent chapters. We search for polynomials P n of degree n such that P n W approximates 1 in some sense on [a −n, a n ].
Eli Levin, Doron S. Lubinsky
openaire   +1 more source

Approximating max–min weighted -joins

Operations Research Letters, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Iwata, Satoru, Ravi, R.
openaire   +1 more source

Weighted Approximation by Rational Operators

Results in Mathematics, 2003
In this interesting paper, the author considers Shephard-type rational operators \[ S_n(f; x)= \Biggl[\sum^{n-1}_{k=1}| x- x_k|^{-s} f(x_k)\Biggr]\Biggl/\Biggl[\sum^{n-1}_{k=1}| x- x_k|^{-s}\Biggr] \] for appropriately chosen nodes \(\{x_k\}\) in \([-1,1]\). Let \(\alpha> 0\) and \[ w(x)= (1- x^2)^\alpha,\quad x\in [-1,1]. \] The author establishes the
openaire   +2 more sources

Approximating weighted induced matchings

Discrete Applied Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Min Chih Lin   +2 more
openaire   +3 more sources

Weighted exponential polynomial approximation

Science in China Series A, 2003
A necessary and sufficient condition for completeness of systems of exponentials with a weight in Lp is established and a quantitative relation between the weight and the system of exponential in Lp is obtained by using a generalization of Malliavin’s uniqueness theorem about Watson’s problem.
openaire   +1 more source

Non-Archimedean Weighted Approximation

1979
Publisher Summary This chapter describes non-archimedean weighted approximation. The chapter illustrates that F is a non-archimedean, non-trivially valued field, which is locally compact for its natural topology. E a non-archimedean locally convex Hausdorff space over F, and ┍ the directed family of all non-archimedean continuous seminorms on E. The
José Paulo, Q. Carneiro
openaire   +1 more source

Weighted Polynomial Approximation of Analytic Functions

Journal of the London Mathematical Society, 1988
For a Borel measure \(d\mu\) on [-1,1] let \(E_ n(f)_{L_ p(d\mu)}\) denote the best approximation of f by polynomials of degree at most n in the space \(L_ p(d\mu)\). Necessary and sufficient condition is given on \(d\mu\) such that the geometric decrease of \(E_ n(f)_{L_ p}(d\mu)\) and the analyticity of f (d\(\mu\)-a.e.) are equivalent.
Saff, E. B., Totik, V.
openaire   +1 more source

Home - About - Disclaimer - Privacy