Bounds for circular error probabilities
โ Scribed by Y. S. Sathe; S. M. Joshi; S. P. Nabar
- Publisher
- John Wiley and Sons
- Year
- 1991
- Tongue
- English
- Weight
- 277 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this article we explore the properties of the discounted total cost function for the economic order quantity. We show that it is convex. Furthermore, it is shown that the classical economic order quantity (based on Wilson's formula) is not less than the true optimum value based on discounting. Bo
Solomonoff sequence prediction is a scheme to predict digits of binary strings without knowing the underlying probability distribution. We call a prediction scheme informed when it knows the true probability distribution of the sequence. Several new relations between universal Solomonoff sequence pr
We establish results on the worst-case errors that can be achieved by wellchosen lattice rules for standard classes of multivariate periodic functions. These theorems improve or generalize earlier results of this type. 1993 Academic Press, Inc
In this paper we first derive a tighter error bound on form factors as a subdivision criterion for the hierarchical radiosity algorithm. Such an error bound can reduce more unnecessary links and improve the performance of the hierarchical radiosity algorithm to meet a user-specified error tolerance.