Results 11 to 20 of about 96,570 (315)

Complexity of Weighted Approximation over Rd [PDF]

open access: yesJournal of Complexity, 2000
AbstractWe study approximation of multivariate functions defined over Rd. We assume that all rth order partial derivatives of the functions considered are continuous and uniformly bounded. Approximation algorithms U(f) only use the values of f or its partial derivatives up to order r.
Grzegorz W. Wasilkowski   +1 more
core   +4 more sources

Weighted sparsity and sparse tensor networks for least squares approximation [PDF]

open access: yes, 2023
The approximation of high-dimensional functions is a ubiquitous problem in many scientific fields that is only feasible practically if advantageous structural properties can be exploited. One prominent structure is sparsity relatively to some basis.
Trunschke, Philipp   +2 more
core   +1 more source

On weighted approximation with Jacobi weights [PDF]

open access: yesJournal of Approximation Theory, 2019
18 ...
Kirill A. Kopotun   +2 more
openaire   +2 more sources

Weighted approximation in $$\mathbb {C}$$ [PDF]

open access: yesMathematische Zeitschrift, 2019
We prove that if $\{ φ_j\}_j$ is a sequence of subharmonic functions which are increasing to some subharmonic function $φ$ in $\mathbb{C}$, then the union of all the weighted Hilbert spaces $H(φ_j)$ is dense in the weighted Hilbert space $H(φ)$.
Fornæss, John Erik, Wu, Jujie
openaire   +2 more sources

Approximation Algorithms for Directed Weighted Spanners [PDF]

open access: yes, 2023
In the pairwise weighted spanner problem, the input consists of a weighted directed graph on n vertices, where each edge is assigned both a cost and a length. Furthermore, we are given k terminal vertex pairs and a distance constraint for each pair.
Lin, Young-San   +2 more
core   +1 more source

Weighted averaging and stochastic approximation [PDF]

open access: yesProceedings of 35th IEEE Conference on Decision and Control, 1997
The authors investigate the relations between weighted averaging and stochastic approximation (SA) algorithms. First, they define the weighted averaging operator and introduce two properties of the operator: regularity and effectiveness. They establish necessary and sufficient conditions on a sequence for convergence of its average.
I-Jeng Wang   +2 more
openaire   +2 more sources

Algorithms and literate programs for weighted low-rank approximation with missing data [PDF]

open access: yes, 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

A Constant-Factor Approximation for Weighted Bond Cover [PDF]

open access: yes, 2021
The Weighted ℱ-Vertex Deletion for a class ℱ of graphs asks, weighted graph G, for a minimum weight vertex set S such that G-S ∈ ℱ. The case when ℱ is minor-closed and excludes some graph as a minor has received particular attention but a constant-factor
Thilikos, Dimitrios M.   +3 more
core   +1 more source

Approximating Power by Weights [PDF]

open access: yesSSRN Electronic Journal, 2018
Determining the power distribution of the members of a shareholder meeting or a legislative committee is a well-known problem for many applications. In some cases it turns out that power is nearly proportional to relative voting weights, which is very beneficial for both theoretical considerations and practical computations with many members.
openaire   +2 more sources

Approximate maximum weight branchings [PDF]

open access: yesInformation Processing Letters, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amitabha Bagchi   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy