Results 11 to 20 of about 1,126,452 (304)
Weighted sparsity and sparse tensor networks for least squares approximation [PDF]
, 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
The Best Approximation of Generalized Fuzzy Numbers Based on Scaled Metric
Journal of Mathematics, 2022 The ongoing study has been vehemently allocated to propound an ameliorated α-weighted generalized approximation of an arbitrary fuzzy number. This method sets out to lessen the distance between the original fuzzy set and its approximation.
Tofigh Allahviranloo +5 more
doaj +1 more source
Approximation Algorithms for Directed Weighted Spanners [PDF]
, 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
Approximating Power by Weights [PDF]
SSRN 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
On Kantorovich modification of ( p , q ) $( p,q ) $ -Baskakov operators
Journal of Inequalities and Applications, 2016 The concern of this paper is to introduce a Kantorovich modification of ( p , q ) $( p,q ) $ -Baskakov operators and investigate their approximation behaviors. We first define a new ( p , q ) $( p,q ) $ -integral and construct the operators.
Tuncer Acar +2 more
doaj +1 more source
Approximate BDD Minimization by Weighted A. [PDF]
2009 IEEE International Symposium on Circuits and Systems, 2009 Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synthesis. The size of BDDs depends on a chosen variable ordering, i.e. the size may vary from linear to exponential, and the existence of a polynomial algorithm to approximate the ...
Rüdiger Ebendt, Rolf Drechsler
openaire +8 more sources
Approximation with exponential weights in [−1,1]
Journal of Mathematical Analysis and Applications, 2002 Let \(w(x):=\exp(-1/(1-x^2)^\alpha)\), \(\alpha>0\), \(|x|
DELLA VECCHIA, Biancamaria +2 more
openaire +3 more sources
A Constant-Factor Approximation for Weighted Bond Cover [PDF]
, 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
MODIFIED MODULUS OF SMOOTHNESS AND APPROXIMATION IN WEIGHTED LORENTZ SPACES BY BOREL AND EULER MEANS
Проблемы анализа, 2020 Using one-sided Steklov means, we introduce a new modulus of smoothness in weighted Lorentz spaces. The direct and inverse approximation theorem for this modulus of smoothness are proved.
S. S. Volosivets
doaj +1 more source
A new construction of Lupaş operators and its approximation properties
Advances in Difference Equations, 2021 The aim of this paper is to study a new generalization of Lupaş-type operators whose construction depends on a real-valued function ρ by using two sequences u m $u_{m} $ and v m $v_{m}$ of functions.
Mohd Qasim +3 more
doaj +1 more source