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
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
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
Optimality of the Approximation and Learning by the Rescaled Pure Super Greedy Algorithms
Axioms, 2022 We propose the Weak Rescaled Pure Super Greedy Algorithm (WRPSGA) for approximation with respect to a dictionary D in Hilbert space. The WRPSGA is simpler than some popular greedy algorithms.
Wenhui Zhang +3 more
doaj +1 more source
How to Network in Online Social Networks [PDF]
, 2013 In this paper, we consider how to maximize users' influence in Online Social Networks (OSNs) by exploiting social relationships only. Our first contribution is to extend to OSNs the model of Kempe et al.
Gabielkov, Maksym +3 more
core +8 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
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
Lebesgue type inequalities for quasi-greedy bases [PDF]
, 2012 We show that for quasi-greedy bases in real or complex Banach spaces the error of the thresholding greedy algorithm of order N is bounded by the best N- term error of approximation times a function of N which depends on the democracy functions and the ...
Garrigós, Gustavo +2 more
core +2 more sources