Results 21 to 30 of about 2,172,385 (299)
Some Upper Bounds for RKHS Approximation by Bessel Functions
Axioms, 2022 A reproducing kernel Hilbert space (RKHS) approximation problem arising from learning theory is investigated. Some K-functionals and moduli of smoothness with respect to RKHSs are defined with Fourier–Bessel series and Fourier–Bessel transforms ...
Mingdang Tian +2 more
doaj +1 more source
An Integral Upper Bound for Neural Network Approximation [PDF]
Neural Computation, 2009 Complexity of one-hidden-layer networks is studied using tools from nonlinear approximation and integration theory. For functions with suitable integral representations in the form of networks with infinitely many hidden units, upper bounds are derived on the speed of decrease of approximation error as the number of network units increases.
Paul C. Kainen, Vera Kurková
openaire +2 more sources
Multi-fuzzy Rough Sets based on Implicators and Continuous t-norms
Fuzzy Information and Engineering, 2017 This paper extends the study of multi-fuzzy rough sets using an implicator and a continuous t-norm and thus introduces multi-fuzzy rough sets based on fuzzy logical connectives.
Gayathri Varma, Sunil Jacob John
doaj +1 more source
Mean square displacement for a discrete centroid model of cell motion.
PLoS ONE, 2021 The mean square displacement (MSD) is an important statistical measure on a stochastic process or a trajectory. In this paper we find an approximation to the mean square displacement for a model of cell motion.
Mary Ellen Rosen +2 more
doaj +1 more source
Upper and Lower Bounds for Deterministic Approximate Objects [PDF]
2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS), 2021 Relaxing the sequential specification of shared objects has been proposed as a promising approach to obtain implementations with better complexity. In this paper, we study the step complexity of relaxed variants of two common shared objects: max registers and counters.
Danny Hendler +3 more
openaire +3 more sources
Approximation hardness of dominating set problems in bounded degree graphs [PDF]
, 2008 We study approximation hardness of the Minimum Dominating Set problem and its variants in undirected and directed graphs. Using a similar result obtained by Trevisan for Minimum Set Cover we prove the first explicit approximation lower bounds for various
Chlebikova, Janka +3 more
core +1 more source
Approximation Set of the Interval Set in Pawlak's Space
The Scientific World Journal, 2014 The interval set is a special set, which describes uncertainty of an uncertain concept or set Z with its two crisp boundaries named upper-bound set and lower-bound set.
Qinghua Zhang +3 more
doaj +1 more source
Weighted Upper Edge Cover: Complexity and Approximability [PDF]
Journal of Graph Algorithms and Applications, 2018 Optimization problems consist of either maximizing or minimizing an objective function. Instead of looking for a maximum solution (resp. minimum solution), one can find a minimum maximal solution (resp. maximum minimal solution). Such "flipping" of the objective function was done for many classical optimization problems.
Khoshkhah, Kaveh +3 more
openaire +5 more sources
Approximation of classes of Poisson integrals by Fejer means
Visnik Harkivsʹkogo Nacionalʹnogo Universitetu im. V.N. Karazina. Cepiâ Matematika, Prikladna Matematika i Mehanika, 2023 The work is devoted to the investigation of problem of approximation of continuous periodic functions by trigonometric polynomials, which are generated by linear methods of summation of Fourier series.
O. G. Rovenska
doaj +3 more sources
A Lattice-Theoretic Approach to Multigranulation Approximation Space
The Scientific World Journal, 2014 In this paper, we mainly investigate the equivalence between multigranulation approximation space and single-granulation approximation space from the lattice-theoretic viewpoint.
Xiaoli He, Yanhong She
doaj +1 more source