Results 1  10
of
157,911
ON THE ASYMPTOTIC ACCURACY OF THE UNION BOUND
, 2005
"... ABSTRACT. A new lower bound on the error probability of maximum likelihood decoding of a binary code on a binary symmetric channel (BSC) was proved in Barg and McGregor (2004, cs.IT/0407011). It was observed in that paper that this bound leads to a new region of code rates in which the random coding ..."
Abstract
 Add to MetaCart
coding exponent is asymptotically tight, giving a new region in which the reliability of the BSC is known exactly. The present paper explains a relation of these results to the union bound on the error probability. 1.
On Asymptotic Accuracy in Queueing Theory
, 2003
"... Recently results have shown that a single server queue Poisson Pareto Burst Process input has a tail which is bounded by hyperbolic functions. We show that the hyperbolic upper and lower bounds for this system can be very misleading, that this hyperbolic tail result is relevant only from a certain t ..."
Abstract
 Add to MetaCart
Recently results have shown that a single server queue Poisson Pareto Burst Process input has a tail which is bounded by hyperbolic functions. We show that the hyperbolic upper and lower bounds for this system can be very misleading, that this hyperbolic tail result is relevant only from a certain threshold onwards, and the magnitude of this threshold may be very large. We also show that any hyperbolic upper and lower bounds for a tail of the stationary waiting time complementary distribution necessarily become further apart as the rate of the process increases.
Asymptotic Accuracy of TwoClass Discrimination
 Proceedings of the Third Annual Symposium on Document Analysis and Information Retrieval, Las Vegas
, 1994
"... Poor quality  e.g. sparse or unrepresentative  training data is widely suspected to be one cause of disappointing accuracy of isolated character classification in modern OCR machines. We conjecture that, for many trainable classification techniques, it is in fact the dominant factor affectin ..."
Abstract
 Add to MetaCart
affecting accuracy. To test this, we have carried out a study of the asymptotic accuracy of three dissimilar classifiers on a difficult twocharacter recognition problem. We state this problem precisely in terms of high quality prototype images and an explicit model of the distribution of image defects
Asymptotic accuracy of Iterative Feedback Tuning
, 2004
"... Iterative Feedback Tuning (IFT) is a widely used procedure for controller tuning. It is a sequence of iteratively performed special experiments on the plant interlaced with periods of data collection under normal operating conditions. In this paper we derive the asymptotic convergence rate of IFT fo ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Iterative Feedback Tuning (IFT) is a widely used procedure for controller tuning. It is a sequence of iteratively performed special experiments on the plant interlaced with periods of data collection under normal operating conditions. In this paper we derive the asymptotic convergence rate of IFT
Comparing Predictive Accuracy
 JOURNAL OF BUSINESS AND ECONOMIC STATISTICS, 13, 253265
, 1995
"... We propose and evaluate explicit tests of the null hypothesis of no difference in the accuracy of two competing forecasts. In contrast to previously developed tests, a wide variety of accuracy measures can be used (in particular, the loss function need not be quadratic, and need not even be symmetri ..."
Abstract

Cited by 1309 (26 self)
 Add to MetaCart
We propose and evaluate explicit tests of the null hypothesis of no difference in the accuracy of two competing forecasts. In contrast to previously developed tests, a wide variety of accuracy measures can be used (in particular, the loss function need not be quadratic, and need not even
On asymptotic accuracy in queueing theory the tale of the misleading tail
"... Abstract — Recently results have shown that a single server queue Poisson Pareto Burst Process input has a tail which is bounded by hyperbolic functions. We show that the hyperbolic upper and lower bounds for this system can be very misleading, that this hyperbolic tail result is relevant only from ..."
Abstract
 Add to MetaCart
Abstract — Recently results have shown that a single server queue Poisson Pareto Burst Process input has a tail which is bounded by hyperbolic functions. We show that the hyperbolic upper and lower bounds for this system can be very misleading, that this hyperbolic tail result is relevant only from a certain threshold onwards, and the magnitude of this threshold may be very large. We also show that any hyperbolic upper and lower bounds for a tail of the stationary waiting time complementary distribution necessarily become further apart as the rate of the process increases. I.
Evaluating the Accuracy of SamplingBased Approaches to the Calculation of Posterior Moments
 IN BAYESIAN STATISTICS
, 1992
"... Data augmentation and Gibbs sampling are two closely related, samplingbased approaches to the calculation of posterior moments. The fact that each produces a sample whose constituents are neither independent nor identically distributed complicates the assessment of convergence and numerical accurac ..."
Abstract

Cited by 583 (14 self)
 Add to MetaCart
accuracy of the approximations to the expected value of functions of interest under the posterior. In this paper methods from spectral analysis are used to evaluate numerical accuracy formally and construct diagnostics for convergence. These methods are illustrated in the normal linear model
Estimation and Inference in Econometrics
, 1993
"... The astonishing increase in computer performance over the past two decades has made it possible for economists to base many statistical inferences on simulated, or bootstrap, distributions rather than on distributions obtained from asymptotic theory. In this paper, I review some of the basic ideas o ..."
Abstract

Cited by 1151 (3 self)
 Add to MetaCart
The astonishing increase in computer performance over the past two decades has made it possible for economists to base many statistical inferences on simulated, or bootstrap, distributions rather than on distributions obtained from asymptotic theory. In this paper, I review some of the basic ideas
A theory of memory retrieval
 PSYCHOL. REV
, 1978
"... A theory of memory retrieval is developed and is shown to apply over a range of experimental paradigms. Access to memory traces is viewed in terms of a resonance metaphor. The probe item evokes the search set on the basis of probememory item relatedness, just as a ringing tuning fork evokes sympath ..."
Abstract

Cited by 728 (81 self)
 Add to MetaCart
comparisons. The mathematical model produces predictions about accuracy, mean reaction time, error latency, and reaction time distributions that are in good accord with experimental data. The theory is applied to four item recognition paradigms (Sternberg, prememorized list, studytest, and continuous
Results 1  10
of
157,911