Results 251 to 260 of about 880,492 (299)

Discrete Approximations of Probability Distributions

Management Science, 1983
Practical limits on the size of most probabilistic models require that probability distributions be approximated by a few representative values and associated probabilities. This paper demonstrates that methods commonly used to determine discrete approximations of probability distributions systematically underestimate the moments of the original ...
Allen C. Miller, III, Thomas R. Rice
exaly   +3 more sources

Discrete approximations to optimization of neutral functional differential inclusions [PDF]

open access: yesJournal of Mathematical Analysis and Applications, 2005
The paper deals with the convergence of discrete approximations to optimization problems governed by neutral functional differential inclusions. The discrete approximations through Euler finite difference are constructed and the convergence of discrete ...
Lianwen Wang
exaly   +2 more sources

DISCRETE CURVATURE APPROXIMATIONS AND SEGMENTATION OF POLYHEDRAL SURFACES [PDF]

open access: yesInternational Journal of Shape Modeling, 2005
The segmentation of digitized data to divide a free form surface into patches is one of the key steps required to perform a reverse engineering process of an object.
Philippe Veron
exaly   +2 more sources

Approximation by Discrete GB-Splines

Numerical Algorithms, 2001
Discrete generalized splines are continuous piecewise defined functions which meet some smoothness conditions for the first and second divided difference at the knots. They are a generalization both of smooth generalized splines and classic discrete cubic splines. The paper is devoted to the study of generalized splines.
openaire   +3 more sources

Approximation by discrete hermite interpolation

2010 11th International Conference on Control Automation Robotics & Vision, 2010
For a function f(t) defined on the discrete interval N[a, b + 2] = {a, a + 1, …, 6 + 2}, we develop a class of quintic discrete Hermite interpolate H ρ f(t) that involves only differences. Further, explicit error bounds are offered in the form of the inequality ||f-H ρ f||≤c j max/t∊N[a, b+2-j] | Δj f(t)|, 2≤j≤6 where the constants C j , 2 ≤ 6 are ...
Fengmin Chen, Patricia J. Y. Wong
openaire   +2 more sources

Discrete analogues of Laplace's approximation

Asymptotic Analysis, 2007
An asymptotic formula is derived for the sum I n (1|q):=Σ n k=0 f n (k)q g n (k)
Wang, X.S., Wong, R.
openaire   +2 more sources

Approximating discrete probability distributions

IEEE Transactions on Information Theory, 1969
The method of minimum discrimination information estimation is applied to the problem of estimating an n -dimensional discrete probability distribution in terms of lower order marginal distributions. The procedure provides a convergent iterative algorithm. The method yields regular best asymptotically normal (RBAN) estimates.
Harry H. Ku, Solomon Kullback
openaire   +2 more sources

Home - About - Disclaimer - Privacy