Results 221 to 230 of about 227,595 (269)
Some of the next articles are maybe not open access.
Flat fading approximation error
IEEE Communications Letters, 2000Flat fading approximation assumes that the system bandwidth is small compared to the coherence bandwidth. An upper bound is derived for an approximation to the error involved in flat fading approximation thereby giving us a measure of the degradation. The bound is found to vary as the square of the system bandwidth to coherence bandwidth ratio.
Prashanth Hande +2 more
openaire +2 more sources
Error correction for approximate computing
2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2016Approximate computing, which sacrifices the accuracy during computation, is a promising technology to save energy. However, large number of computation errors may violate the accuracy requirement of certain applications and should be corrected. Consider a Graphical Processing Unit (GPU) with multiple Streaming Multiprocessors (SMs), where some of these
Hang Zhang 0013 +3 more
openaire +2 more sources
Approximate testing with relative error
Proceedings of the thirty-first annual ACM symposium on Theory of Computing, 1999We formalize the notion and initiate the investigation of approximate testing for arbitrary forms of the error term. Until now only the case of absolute error had been addressed ignoring the fact that often only the most significant figures of a numerical calculation are valid.
Marcos A. Kiwi +2 more
openaire +2 more sources
Asymptotic Approximations and Error Bounds
SIAM Review, 1980The purpose of this paper is to demonstrate that well-constructed error bounds for asymptotic approximations can provide useful analytical insight into the nature and reliability of the approximati...
openaire +2 more sources
Approximate Standard Errors in Semiparametric Models
Biometrics, 1999Summary.SUMMARY. We consider semiparametric models with p regressor terms and q smooth terms. We obtain an explicit expression for the estimate of the regression coefficients given by the back‐fitting algorithm. The calculation of the standard errors of these estimates based on this expression is a considerable computational exercise.
Durban, Maria +2 more
openaire +3 more sources
1993
In physics, as in other sciences, approximation is the rule of the day. The theoretical work involved in preparing an experiment and the interpretation of the experiment’s results are approximate in nature. Much purely theoretical work also involves approximation of one sort or another, while laboratory work yields results that are reproducible at best
openaire +1 more source
In physics, as in other sciences, approximation is the rule of the day. The theoretical work involved in preparing an experiment and the interpretation of the experiment’s results are approximate in nature. Much purely theoretical work also involves approximation of one sort or another, while laboratory work yields results that are reproducible at best
openaire +1 more source
Error Estimates for the Approximation of the Effective Hamiltonian
Applied Mathematics and Optimization, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
CAMILLI, FABIO +2 more
openaire +2 more sources
2001
In this chapter we will be interested in determining the error d(x, K) made in approximating the element x by the elements of a convex set K. We have already given an explicit formula for the distance d(x, K) in the last chapter (Theorem 6.25), and a strengthening of this distance formula in the particular case where the convex set K is either a convex
openaire +1 more source
In this chapter we will be interested in determining the error d(x, K) made in approximating the element x by the elements of a convex set K. We have already given an explicit formula for the distance d(x, K) in the last chapter (Theorem 6.25), and a strengthening of this distance formula in the particular case where the convex set K is either a convex
openaire +1 more source
Probabilistic Error Modeling for Approximate Adders
IEEE Transactions on Computers, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sana Mazahir +4 more
openaire +3 more sources
On Chebyshev Approximation with Relative Error
1983Let \(h\in C[-1,1]\), and suppose that h has at most a finite number of zeros \(x_ i\), \(i=1,2,...,k\), on [-1,1]. Further suppose that \(h(x)\sim C_ i(x-x_ i)^{n_ i}\) as \(x\to x_ i\), \(C_ i\neq 0\), where the \(n_ i\) are positive integers. Let the polynomial \(P_ h(x)=\prod^{k}_{i=1}(x-x_ i)^{n_ i}\) be assigned to h.
openaire +2 more sources