Results 271 to 280 of about 1,062,165 (308)
Some of the next articles are maybe not open access.
"Approximate approximations" and the cubature of potentials
1995The paper discusses new cubature formulas for classical integral operators of mathematical physics based on the "approximate approximation" of the density with Gaussian and related functions. We derive formulas for the cubature of harmonic, elastic and diffraction potentials approximating with high order in some range relevant for numerical ...
Maz'ya, Vladimir, Schmidt, Gunther
openaire +2 more sources
Approximating Approximate Fibrations by Fibrations
Canadian Journal of Mathematics, 1977A map p: E → B between metric spaces has the approximate homotopy lifting property with respect to the space X if given a cover Ū of B and maps g: X → E and H: X × [0, 1] → B such that H(x, 0) = pg(x) for all x ϵ X, then there exists a map G: X × [0, 1] → E such that G(x, 0) = g(x) and pGt and Ht are Ū-close for all x ϵ X and t ϵ [0, 1]; i.e. given (x,
openaire +1 more source
Journal of Algorithms, 2001
Summary: Approximation algorithms for NP-hard optimization problems have been widely studied for over three decades. Most of these measure the quality of the solution produced by taking the ratio of the cost of the solution produced by the algorithm to the cost of an optimal solution.
Refael Hassin, Samir Khuller
openaire +3 more sources
Summary: Approximation algorithms for NP-hard optimization problems have been widely studied for over three decades. Most of these measure the quality of the solution produced by taking the ratio of the cost of the solution produced by the algorithm to the cost of an optimal solution.
Refael Hassin, Samir Khuller
openaire +3 more sources
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 2015
A set function on a ground set of size n is approximately modular if it satisfies every modularity requirement to within an additive error, approximate modularity is the set analog of approximate linearity. In this paper we study how close, in additive error, can approximately modular functions be to truly modular functions.
CHIERICHETTI, FLAVIO +3 more
openaire +3 more sources
A set function on a ground set of size n is approximately modular if it satisfies every modularity requirement to within an additive error, approximate modularity is the set analog of approximate linearity. In this paper we study how close, in additive error, can approximately modular functions be to truly modular functions.
CHIERICHETTI, FLAVIO +3 more
openaire +3 more sources
Analytical Approximations to Approximations in the Chebyshev Sense
Bell System Technical Journal, 1970This paper concerns approximation in the Chebyshev, or minimax sense such that (i) a minimax approximation implies a maximum number of zero error points separated by equal error extrema, and (ii) the approximating function can be so formulated that the disposable parameters are all the coefficients in a polynomial, which may however be part of a more ...
openaire +3 more sources
Approximate Polynomial GCD by Approximate Syzygies
Mathematics in Computer Science, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Approximated approximations for SAO
Structural and Multidisciplinary Optimization, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Groenwold, A.A. +2 more
openaire +3 more sources
2013
Keeping items in order is at the essence of organizing information. This paper derives an information theoretic method for approximate sorting. It is optimal in the sense that it extracts as much reliable order information as possible from possibly noisy comparison input data.
Busse Ludwig M. +2 more
openaire +1 more source
Keeping items in order is at the essence of organizing information. This paper derives an information theoretic method for approximate sorting. It is optimal in the sense that it extracts as much reliable order information as possible from possibly noisy comparison input data.
Busse Ludwig M. +2 more
openaire +1 more source
COMBINATORICA, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
From approximate balls to approximate ellipses
Journal of Global Optimization, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Asish Mukhopadhyay +3 more
openaire +1 more source