Results 71 to 80 of about 522,371 (218)
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More
We consider questions that arise from the intersection between the areas of polynomial-time approximation algorithms, subexponential-time algorithms, and fixed-parameter tractable algorithms.
Chalermsook, Parinya +6 more
core +1 more source
Application of the exact muffin-tin orbitals theory: the spherical cell approximation [PDF]
We present a self-consistent electronic structure calculation method based on the exact muffin-tin orbitals (EMTO) theory developed by O.K. Andersen, O. Jepsen and G. Krier [in: V. Kumar, O.K. Andersen, A.
L. Vitos +9 more
semanticscholar +1 more source
Mathematical Modeling on a Physics-Informed Radial Basis Function Network
The article is devoted to approximate methods for solving differential equations. An approach based on neural networks with radial basis functions is presented. Neural network training algorithms adapted to radial basis function networks are proposed, in
Dmitry Stenkin, Vladimir Gorbachenko
doaj +1 more source
A Programmable Look-Up Table-Based Interpolator with Nonuniform Sampling Scheme
Interpolation is a useful technique for storage of complex functions on limited memory space: some few sampling values are stored on a memory bank, and the function values in between are calculated by interpolation.
Élvio Carlos Dutra e Silva Júnior +3 more
doaj +1 more source
Primal and Dual Approximation Algorithms for Convex Vector Optimization Problems
Two approximation algorithms for solving convex vector optimization problems (CVOPs) are provided. Both algorithms solve the CVOP and its geometric dual problem simultaneously. The first algorithm is an extension of Benson's outer approximation algorithm,
Löhne, Andreas +2 more
core +1 more source
Differentiable Earth mover’s distance for data compression at the high-luminosity LHC
The Earth mover’s distance (EMD) is a useful metric for image recognition and classification, but its usual implementations are not differentiable or too slow to be used as a loss function for training other algorithms via gradient descent. In this paper,
Rohan Shenoy +7 more
doaj +1 more source
Restoration algorithms of signals and images on the basis of their generalized spectra in bases of orthogonal polynomials and functions at absence and presence of random distortions have been examined. It is shown that in absence of hindrances the number
Oleg V. Chernoyarov +2 more
doaj +1 more source
The proposed multi-objective optimization algorithm hybridizes random global search with a local refinement algorithm. The global search algorithm mimics the Bayesian multi-objective optimization algorithm.
Linas Litvinas
doaj +1 more source
Almost-Smooth Histograms and Sliding-Window Graph Algorithms
We study algorithms for the sliding-window model, an important variant of the data-stream model, in which the goal is to compute some function of a fixed-length suffix of the stream.
Krauthgamer, Robert, Reitblat, David
core
Handling convexity-like constraints in variational problems
We provide a general framework to construct finite dimensional approximations of the space of convex functions, which also applies to the space of c-convex functions and to the space of support functions of convex bodies.
Mérigot, Quentin, Oudet, Edouard
core +4 more sources

