Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
285,996
Searching for Asymptotic Error Repair
, 2003
"... We work in the domain of a regional least-cost strategy with dynamic validation in order to avoid cascaded errors [3], extending the theoretical model to illustrate its asymptotic equivalence with global repair algorithms. This is an objective criterion to measure the quality of an error repair ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
We work in the domain of a regional least-cost strategy with dynamic validation in order to avoid cascaded errors [3], extending the theoretical model to illustrate its asymptotic equivalence with global repair algorithms. This is an objective criterion to measure the quality of an error repair
Searching for Asymptotic Error Repair
, 2002
"... We work in the domain of a regional least-cost strategy with dynamic validation in order to avoid cascaded errors [3], extending the theoretical model to illustrate its asymptotic equivalence with global repair algorithms. This is an objective criterion to measure the quality of an error repair ..."
Abstract
- Add to MetaCart
We work in the domain of a regional least-cost strategy with dynamic validation in order to avoid cascaded errors [3], extending the theoretical model to illustrate its asymptotic equivalence with global repair algorithms. This is an objective criterion to measure the quality of an error repair
Searching for asymptotic error repair?
"... All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract
- Add to MetaCart
All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.
Asymptotic error distributions for the Euler method for stochastic differential equations
- THE ANNALS OF PROBABILITY
, 1998
"... We are interested in the rate of convergence of the Euler scheme approximation of the solution to a stochastic differential equation driven by a general (possibly discontinuous) semimartingale, and by the asymptotic behavior of the associated normalized error. It is well known that for Itô’s equatio ..."
Abstract
-
Cited by 180 (13 self)
- Add to MetaCart
We are interested in the rate of convergence of the Euler scheme approximation of the solution to a stochastic differential equation driven by a general (possibly discontinuous) semimartingale, and by the asymptotic behavior of the associated normalized error. It is well known that for Itô’s
Asymptotic error rates in quantum hypothesis testing
- Commun. Math. Phys
, 2008
"... We consider the problem of discriminating between two different states of a finite quantum system in the setting of large numbers of copies, and find a closed form expression for the asymptotic exponential rate at which the specified error probability tends to zero. This leads to the identification ..."
Abstract
-
Cited by 36 (9 self)
- Add to MetaCart
We consider the problem of discriminating between two different states of a finite quantum system in the setting of large numbers of copies, and find a closed form expression for the asymptotic exponential rate at which the specified error probability tends to zero. This leads to the identification
On Discriminative vs. Generative classifiers: A comparison of logistic regression and naive Bayes
, 2001
"... We compare discriminative and generative learning as typified by logistic regression and naive Bayes. We show, contrary to a widely held belief that discriminative classifiers are almost always to be preferred, that there can often be two distinct regimes of performance as the training set size is i ..."
Abstract
-
Cited by 513 (8 self)
- Add to MetaCart
is increased, one in which each algorithm does better. This stems from the observation -- which is borne out in repeated experiments -- that while discriminative learning has lower asymptotic error, a generative classifier may also approach its (higher) asymptotic error much faster.
Asymptotic Error Analysis of the Adaptive Verlet Method
- BIT
, 1998
"... The Adaptive Verlet method [7] and variants [1] are time-reversible schemes for treating Hamiltonian systems subject to a Sundman time transformation. These methods have been observed in computer experiments to exhibit superior numerical stability when implemented in a counterintuitive "recipro ..."
Abstract
-
Cited by 8 (5 self)
- Add to MetaCart
;reciprocal" formulation. Here we give a theoretical explanation of this behavior by examining the leading terms of the modified equation (backward error analysis) and those of the asymptotic error expansion. With this insight we are able to improve the algorithm by simply correcting the starting stepsize. keywords
Asymptotic Confidence Intervals for Indirect Effects in Structural EQUATION MODELS
- IN SOCIOLOGICAL METHODOLOGY
, 1982
"... ..."
Upper bounds on the error probabilities and asymptotic error exponents in
"... quantum multiple state discrimination ..."
Good Error-Correcting Codes based on Very Sparse Matrices
, 1999
"... We study two families of error-correcting codes defined in terms of very sparse matrices. "MN" (MacKay--Neal) codes are recently invented, and "Gallager codes" were first investigated in 1962, but appear to have been largely forgotten, in spite of their excellent properties. The ..."
Abstract
-
Cited by 741 (23 self)
- Add to MetaCart
We study two families of error-correcting codes defined in terms of very sparse matrices. "MN" (MacKay--Neal) codes are recently invented, and "Gallager codes" were first investigated in 1962, but appear to have been largely forgotten, in spite of their excellent properties
Results 1 - 10
of
285,996
