Results 291 to 300 of about 631,044 (314)

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

Home - About - Disclaimer - Privacy