Results 31 to 40 of about 87,603 (273)
Lebesgue constants for Chebyshev thresholding greedy algorithms
Journal of Inequalities and Applications, 2018 We investigate the efficiency of Chebyshev Thresholding Greedy Algorithm (CTGA) for an n-term approximation with respect to general bases in a Banach space. We show that the convergence property of CTGA is better than TGA for non-quasi-greedy bases. Then
Chunfang Shao, Peixin Ye
doaj +1 more source
Regularized Submodular Maximization With a
IEEE Access, 2023 With the development of the Internet and the emergence of various social-media platforms, designing approximation algorithms for optimization problems such as the influence maximization in social networks has received widespread attention.
Qingqin Nong, Zhijia Guo, Suning Gong
doaj +1 more source
Sketch-based Influence Maximization and Computation: Scaling up with Guarantees [PDF]
, 2014 Propagation of contagion through networks is a fundamental process. It is used to model the spread of information, influence, or a viral infection.
Chen W. +4 more
core +1 more source
Adaptive Piecewise Poly-Sinc Methods for Ordinary Differential Equations
Algorithms, 2022 We propose a new method of adaptive piecewise approximation based on Sinc points for ordinary differential equations. The adaptive method is a piecewise collocation method which utilizes Poly-Sinc interpolation to reach a preset level of accuracy for the
Omar Khalil +3 more
doaj +1 more source
Reduced Basis Approximation for a Spatial Lotka-Volterra Model
Mathematics, 2022 We construct a reduced basis approximation for the solution to a system of nonlinear partial differential equations describing the temporal evolution of two populations following the Lotka-Volterra law. The first population’s carrying capacity contains a
Peter Rashkov
doaj +1 more source
A Functional Characterization of Almost Greedy and Partially Greedy Bases in Banach Spaces
Mathematics, 2021 In 2003, S. J. Dilworth, N. J. Kalton, D. Kutzarova and V. N. Temlyakov introduced the notion of almost greedy (respectively partially greedy) bases. These bases were characterized in terms of quasi-greediness and democracy (respectively conservativeness)
Pablo Manuel Berná, Diego Mondéjar
doaj +1 more source
, 2014 Is it possible to maximize a monotone submodular function faster than the widely used lazy greedy algorithm (also known as accelerated greedy), both in theory and practice?
Badanidiyuru, Ashwinkumar +4 more
core +1 more source
Greedy Approximation in Convex Optimization [PDF]
Constructive Approximation, 2015 We study sparse approximate solutions to convex optimization problems. It is known that in many engineering applications researchers are interested in an approximate solution of an optimization problem as a linear combination of elements from a given system of elements. There is an increasing interest in building such sparse approximate solutions using
openaire +2 more sources
Bit-filling algorithm for fast subcarrier-selecting in ultrasonic through-metal communication
Tongxin xuebao, 2020 Aiming at the high complexity of the greedy bit-filling algorithm,a bit-filling algorithm for fast subcarrier-selecting used in ultrasonic through-metal communication was proposed.The approximate expression for the BER increment,which was used as the ...
Linsen XU +3 more
doaj +2 more sources
A Performance Study of Some Approximation Algorithms for Computing a Small Dominating Set in a Graph
Algorithms, 2020 We implement and test the performances of several approximation algorithms for computing the minimum dominating set of a graph. These algorithms are the standard greedy algorithm, the recent Linear programming (LP) rounding algorithms and a hybrid ...
Jonathan Li +2 more
doaj +1 more source