Results 231 to 240 of about 3,264,185 (285)
Some of the next articles are maybe not open access.
Estimation of Classification Error
IEEE Transactions on Computers, 1970This paper discusses methods of estimating the probability of error for the Bayes' classifier which must be designed and tested with a finite number of classified samples. The expected difference between estimates is discussed. A simplifled algorithm to compute the leaving-one-out method is proposed for multivariate normal distributions wtih unequal co-
Fukunaga, Keinosuke, Kessell, David L.
openaire +1 more source
Microstructural Decomposition Error Estimates
ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1999AbstractComputational simulations of interacting microstructure in solid structures, with methods such as the finite element method, require solutions to numerically enormous boundary value problems. The primary objective of this work is to introduce a‐posteriori error bounds for a domain decomposition which can be used to reduce the computational ...
Zohdi, T., Wriggers, P.
openaire +1 more source
A-posteriori estimation of the error in the error estimate
Computer Methods in Applied Mechanics and Engineering, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Strouboulis, T. +4 more
openaire +1 more source
Bootstrap Techniques for Error Estimation
IEEE Transactions on Pattern Analysis and Machine Intelligence, 1987The design of a pattern recognition system requires careful attention to error estimation. The error rate is the most important descriptor of a classifier's performance. The commonly used estimates of error rate are based on the holdout method, the resubstitution method, and the leave-one-out method.
Jain, Anil K. +2 more
openaire +3 more sources
USSR Computational Mathematics and Mathematical Physics, 1976
Abstract THE CASE of a function, acting from metric space whose measure is matched in a natural way with itstopology, into separable metric space is considered, and lower bounds are constructed for the error functional in integral norms, these bounds being independent of the method of solution.
openaire +1 more source
Abstract THE CASE of a function, acting from metric space whose measure is matched in a natural way with itstopology, into separable metric space is considered, and lower bounds are constructed for the error functional in integral norms, these bounds being independent of the method of solution.
openaire +1 more source
Pattern Recognition, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Braga-Neto, Ulisses, Dougherty, Edward
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Braga-Neto, Ulisses, Dougherty, Edward
openaire +2 more sources
2016
Imagine the following situation: Your boss asks you to get a measure of the reliability and convergence speed of some code that solves a complicated problem. Your company has spent a lot of money on it and the modules of the code consist of many thousands of lines.
Gisbert Stoyan, Agnes Baran
openaire +1 more source
Imagine the following situation: Your boss asks you to get a measure of the reliability and convergence speed of some code that solves a complicated problem. Your company has spent a lot of money on it and the modules of the code consist of many thousands of lines.
Gisbert Stoyan, Agnes Baran
openaire +1 more source
Error Estimation for Nordsieck Methods
Numerical Algorithms, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Butcher, J. C., Jackiewicz, Z.
openaire +2 more sources
2003
In this chapter we assume the spacetime K is foliated by a double null canonical foliation that satisfies the assumptions $$O \leqslant \epsilon_0 ,\,D \leqslant \epsilon_0 ,$$ (6.0.1) and we make use of the inequality proved in Theorem M7 $$R \leqslant cQ_K^{\frac{1} {2}} .$$ (6.0.2)
Sergiu Klainerman, Francesco Nicolò
openaire +1 more source
In this chapter we assume the spacetime K is foliated by a double null canonical foliation that satisfies the assumptions $$O \leqslant \epsilon_0 ,\,D \leqslant \epsilon_0 ,$$ (6.0.1) and we make use of the inequality proved in Theorem M7 $$R \leqslant cQ_K^{\frac{1} {2}} .$$ (6.0.2)
Sergiu Klainerman, Francesco Nicolò
openaire +1 more source