Results 271 to 280 of about 75,209 (310)
Some of the next articles are maybe not open access.
2014
In Chap. 3, we discussed the main ideas of fully reliable error control methods and the corresponding numerical algorithms with the paradigm of simple elliptic type problems. This chapter is intended to show a deep connection between a posteriori estimates of the functional type and physical relations generating the problem.
Olli Mali +2 more
openaire +1 more source
In Chap. 3, we discussed the main ideas of fully reliable error control methods and the corresponding numerical algorithms with the paradigm of simple elliptic type problems. This chapter is intended to show a deep connection between a posteriori estimates of the functional type and physical relations generating the problem.
Olli Mali +2 more
openaire +1 more source
A Bound for Error-Correcting Codes
IBM Journal of Research and Development, 1960This paper gives two new bounds for the code word length n which is required to obtain a binary group code of order 2k with mutual distance d between code words. These bounds are compared with previously known bounds, and are shown to improve upon them for certain ranges of k and d. Values of k and d are given for which one of these bounds can actually
openaire +1 more source
2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 2019
We present a feedback motion planning algorithm, Bounded-Error LQR-Trees, that leverages reinforcement learning theory to find a policy with a bounded amount of error. The algorithm composes locally valid linear-quadratic regulators (LQR) into a nonlinear controller, similar to how LQR-Trees constructs its policy, but minimizes the cost of the ...
Barrett Ames, George Dimitri Konidaris
openaire +1 more source
We present a feedback motion planning algorithm, Bounded-Error LQR-Trees, that leverages reinforcement learning theory to find a policy with a bounded amount of error. The algorithm composes locally valid linear-quadratic regulators (LQR) into a nonlinear controller, similar to how LQR-Trees constructs its policy, but minimizes the cost of the ...
Barrett Ames, George Dimitri Konidaris
openaire +1 more source
Error bounds for correlation clustering
Proceedings of the 22nd international conference on Machine learning - ICML '05, 2005This paper presents a learning theoretical analysis of correlation clustering (Bansal et al., 2002). In particular, we give bounds on the error with which correlation clustering recovers the correct partition in a planted partition model (Condon & Karp, 2001; McSherry, 2001).
Thorsten Joachims, John E. Hopcroft
openaire +1 more source
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
On error bounds and turbo-codes
IEEE Communications Letters, 1999Turbo-codes have been hailed as the ultimate step toward achieving the capacity limit Shannon established some 50 years ago. We look at the performance of turbo-codes with respect to various information theoretic error bounds. This comparison suggests that, if (block, or) frame error rates are considered, careful interleaver design is necessary to ...
Christian Schlegel, Lance C. Pérez
openaire +1 more source
Bounding the Error in Spline Interpolation
SIAM Review, 1974This paper is intended to illustrate by an example a generally useful technique for bounding interpolation error. At the same time, the particular example chosen is meant to call attention to an interesting and important unsolved problem in elementary polynomial spline theory.
openaire +1 more source
An error bound for a noise canceller
IEEE Transactions on Acoustics, Speech, and Signal Processing, 1989The degradation in performance of the least-mean-square estimation (LMSE) is evaluated after replacing the covariance matrices with estimates. Taking advantage of the statistical properties of the complex Wishart matrix and its inverse, the decrease in performance stemming from this substitution is investigated.
Pierre Comon, Dinh-Tuan Pham
openaire +1 more source
An error bound for the Born approximation
Inverse Problems, 2004Summary: We derive an explicit error bound for the Born approximation for the inverse scattering problem of the Helmholtz equation at fixed frequency.
openaire +1 more source
Error bounds for Romberg quadrature
Numerische Mathematik, 1999An important question in the theory of numerical integration rules is the relative quality of different types of integration rules. The authors derive new error bounds for the Romberg rules and compare these bounds with previously obtained bounds for Gauss rules.
Helmut Brass, J.-W. Fischer
openaire +2 more sources