Results 281 to 290 of about 2,095,948 (338)

Joint Beamforming and Trajectory Optimization Algorithm for RSMA-UAV-Enabled Integrated Sensing and Communication System. [PDF]

Sensors (Basel)
Wang S, Zhu Q.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Approximation capabilities of multilayer feedforward networks

Neural Networks, 1991
Kurt Horník
exaly   +2 more sources

Approximate Memory with Approximate DCT

Proceedings of the 2019 Great Lakes Symposium on VLSI, 2019
Approximate Computing is an emerging computing paradigm where one exploits inherent error resilience of certain applications (e.g., digital signal processing, multimedia and artificial intelligence) and trades off absolute computation precisions for performance, power, area, and/or efficiency gains.
Shenghou Ma, Paul Ampadu
openaire   +2 more sources

Approximate Sorting

Fundamenta Informaticae, 2006
We show that any comparison based, randomized algorithm to approximate any given ranking of n items within expected Spearman's footrule distance n ^{2} /ν(n) needs at least n (min{log ν(n), log n} − 6) comparisons in the worst case.
Joachim Giesen, Eva Schuberth, Milos Stojakovic   +2 more
openaire   +3 more sources

"Approximate approximations" and the cubature of potentials

1995
The 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, 1977
A 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

z-Approximations

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

Approximate Modularity

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, Das, Abhimanyu, Dasgupta, Anirban, Kumar, Ravi   +3 more
openaire   +3 more sources

Analytical Approximations to Approximations in the Chebyshev Sense

Bell System Technical Journal, 1970
This 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, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources