Results 11 to 20 of about 57,258 (313)
Improved Multi-Pass Streaming Algorithms for Submodular Maximization with Matroid Constraints [PDF]
, 2020 We give improved multi-pass streaming algorithms for the problem of maximizing a monotone or arbitrary non-negative submodular function subject to a general p-matchoid constraint in the model in which elements of the ground set arrive one at a time in a ...
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020) +6 more
core +1 more source
Hardness of submodular cost allocation : lattice matching and a simplex coloring conjecture [PDF]
, 2014 We consider the Minimum Submodular Cost Allocation (MSCA) problem. In this problem, we are given k submodular cost functions f1, ... , fk: 2V -> R+ and the goal is to partition V into k sets A1, ..., Ak so as to minimize the total cost sumi = 1,k fi(Ai).
Vondrák, Jan, Ene, Alina
core +1 more source
Радіоелектронні і комп'ютерні системи, 2018 The problem of big data sets processing is considered. Efficiency of algorithms depends mainly on the appropriate mathematical tools. Now there exists a wide variety of different constructive tools for information analysis.
Iryna Victorivna Brysina +1 more
doaj +1 more source
Simple Synchronous and Asynchronous Algorithms for Distributed Minimax Optimization
SICE Journal of Control, Measurement, and System Integration, 2017 Synchronous and asynchronous algorithms are presented for distributed minimax optimization. The objective here is to realize the minimization of the maximum of component functions over the standard multi-agent network, where each node of the network ...
Kenta Hanada +3 more
doaj +1 more source
Approximation algorithms and inapproximability of partition functions of spin systems
, 2020 Over the past 30 years, the study of counting problems has become an interesting and important work. The framework of counting problems can capture applications in diverse fields, such as graph colouring and homomorphism in graph theory, and the Ising ...
Yang, Kuan
core +1 more source
Approximation of Bayesian inverse problems for PDEs [PDF]
, 2010 Inverse problems are often ill posed, with solutions that depend sensitively on data. In any numerical approach to the solution of such problems, regularization of some form is needed to counteract the resulting instability.
Dashti, Massoumeh +7 more
core +1 more source
Approximation method for a fractional order transfer function with zero and pole
Archives of Control Sciences, 2014 The paper presents an approximation method for elementary fractional order transfer function containing both pole and zero. This class of transfer functions can be applied for example to build model - based special control algorithms. The proposed method
Oprzędkiewicz Krzysztof
doaj +1 more source
Optimal Centers’ Allocation in Smoothing or Interpolating with Radial Basis Functions
Mathematics, 2021 Function interpolation and approximation are classical problems of vital importance in many science/engineering areas and communities. In this paper, we propose a powerful methodology for the optimal placement of centers, when approximating or ...
Pedro González-Rodelas +3 more
doaj +1 more source
Local RBF approximation for scattered data fitting with bivariate splines [PDF]
, 2005 In this paper we continue our earlier research [4] aimed at developing effcient methods of local approximation suitable for the first stage of a spline based two-stage scattered data fitting algorithm.
Oleg Davydov +5 more
core +1 more source
Dual Taylor Series, Spline Based Function and Integral Approximation and Applications
Mathematical and Computational Applications, 2019 In this paper, function approximation is utilized to establish functional series approximations to integrals. The starting point is the definition of a dual Taylor series, which is a natural extension of a Taylor series, and spline based series ...
Roy M. Howard
doaj +1 more source