Results 31 to 40 of about 1,126,452 (304)
The Annals of Mathematical Statistics, 1948 The greatest fractional increase in variance when a weighted mean is calculated with approximate weights is, quite closely, the square of the largest fractional error in an individual weight. The average increase will be about one-half this amount. The use of weights accurate to two significant figures, or even to the nearest number of the form: 10, 11,
openaire +2 more sources
Algorithms and literate programs for weighted low-rank approximation with missing data
, 2010 Linear models identification from data with missing values is posed as a weighted low-rank approximation problem with weights related to the missing values equal to zero.
Markovsky, Ivan, Ivan Markovsky
core +1 more source
MathematicsIn this paper, a generalized sequence of Baskakov operators connected to the Riemann–Liouville fractional integral is introduced. These sequences of operators deal with smooth approximation behavior in a wider class, i.e., a class of measurable functions
Tripuresh Mishra +3 more
doaj +1 more source
A new approach to nonlinear singular integral operators depending on three parameters
Open Mathematics, 2016 In this paper, we present some theorems on weighted approximation by two dimensional nonlinear singular integral operators in the following form: Tλ(f;x,y)=∬R2Kλ(t−x,s−y,f(t,s))dsdt,(x,y)∈R2,λ∈Λ,$${T_\lambda }(f;x,y) = \iint\limits_{{\mathbb{R}^2}}K_ ...
Uysal Gumrah
doaj +1 more source
Chebyshev Approximations by Least Squares Method
Известия Иркутского государственного университета: Серия "Математика", 2020 We consider the problem of linear approximation in the form of the minimization problem of the weighted Chebyshev norm, and that in the form of the minimization problem of the weighted Euclidean norm of the residual vector.
V.I. Zorkaltsev, E. V. Gubiy
doaj +1 more source
Improved approximation algorithms for optimization problems in graphs with superlogarithmic treewidth [PDF]
, 2003 In this paper we present two novel generic schemes for approximation algorithms for optimization to partial k-trees. Our first scheme yields deterministic polynomialtime algorithms achieving typically an approximation factor of k/ log n, where k
Chlebikova, Janka +14 more
core +1 more source
Approximation by weighted polynomials
Journal of Approximation Theory, 2003 The paper is devoted to the study of approximation by weighted polynomials. The author proves that if \(xQ'(x)\) is increasing on \((0,\infty)\) and \(w(x)= \exp(-Q(x))\) is the corresponding weight on \([0,\infty)\), then every continuous function that vanishes outside.
openaire +1 more source
Rigorous approximated determinization of weighted automata [PDF]
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Benjamin Aminof +2 more
openaire +2 more sources
Generalized weighted Sobolev spaces and applications to Sobolev orthogonal polynomials, I [PDF]
, 2004 36 pages, no figures.-- MSC2000 codes: 41A10, 46E35, 46G10.-- Part II of this paper published in: Approx. Theory Appl. 18(2): 1-32 (2002), available at: http://e-archivo.uc3m.es/handle/10016/6483MR#: MR2047389 (2005k:42062)Zbl#: Zbl 1081.42024In this ...
Pestana, Domingo +3 more
core +1 more source
Approximation Algorithms for Maximum Weighted Throughput on Unrelated Machines [PDF]
, 2023 We study the classic weighted maximum throughput problem on unrelated machines. We give a (1-1/e-ε)-approximation algorithm for the preemptive case. To our knowledge this is the first ever approximation result for this problem.
Karakostas, George +1 more
core +1 more source