Results 141 to 150 of about 1,014,881 (173)
Some of the next articles are maybe not open access.
Information-theoretic upper and lower bounds for statistical estimation
IEEE Transactions on Information Theory, 2006In this paper, we establish upper and lower bounds for some statistical estimation problems through concise information-theoretic arguments. Our upper bound analysis is based on a simple yet general inequality which we call the information exponential inequality.
openaire +2 more sources
An upper bound on average estimation error in nonlinear systems
IEEE Transactions on Information Theory, 1968An upper bound is obtained on the probability density of the estimate of the parameter m when a nonlinear function s(t, m) is transmitted over a channel that adds Gaussian noise, and maximum likelihood or maximum a posteriori estimation is used. If this bound is integrated with a loss function, an upper bound on the average error is obtained. Nonlinear
openaire +1 more source
On the estimates of the upper and lower bounds of Ramanujan primes
The Ramanujan Journal, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang, Shichun, Togbé, Alain
openaire +2 more sources
An upper bound estimate for the entropy of Korean texts
Literary and Linguistic Computing, 1996The entropy of printed languages suggests how predictable the language usages are and how efficiently the printed texts can be handled in text processing. In this paper, for the first time we present an upper bound estimate of the entropy for printed Korean. We obtained 6.01 bits for each Korean syllable.
YS Han young s. han +3 more
openaire +1 more source
An Upper Confidence Bound Approach to Estimating Coherent Risk Measures
2019 Winter Simulation Conference (WSC), 2019Coherent risk measures have received increasing attention in recent years among both researchers and practitioners. The problem of estimating a coherent risk measure can be cast as estimating the maximum expected loss taken under a set of probability measures.
Guangwu Liu, Wen Shi, Kun Zhang 0036
openaire +1 more source
Blind estimation of MIMO channels with an upper bound for channel orders
Signal Processing, 2006Many known second-order statistics (SOS)-based blind algorithms for MIMO channel estimation, including the subspace (SS) and linear prediction (LP) method, are sensitive to channel-order overestimations. To overcome this problem, an algorithm is proposed in [IEEE Trans.
Yonghong Zeng, Tung-Sang Ng
openaire +3 more sources
Localized Upper and Lower Bounds for Some Estimation Problems
2005We derive upper and lower bounds for some statistical estimation problems. The upper bounds are established for the Gibbs algorithm. The lower bounds, applicable for all statistical estimators, match the obtained upper bounds for various problems. Moreover, our framework can be regarded as a natural generalization of the standard minimax framework, in ...
openaire +1 more source
A procedure for estimation of the upper bound for earthquake magnitudes
Physics of the Earth and Planetary Interiors, 1983Abstract A procedure is described for estimation of the maximum feasible magnitude for earthquakes in a given region. This procedure provides a confidence interval for the upper bound without the need for any numerical calculation.
openaire +1 more source
Asymptotically Minimax Adaptive Estimation. I: Upper Bounds. Optimally Adaptive Estimates
Theory of Probability & Its Applications, 1992The author presents some new solutions of functional adaptive estimation problems arising in stochastic systems with disturbing parameters affecting the accuracy of estimation. The problems considered include estimation of a signal in a Gaussian white noise, estimation of a functional acting on such a signal, prediction in a polynomial regression with ...
openaire +2 more sources
Upper-Bound Error Estimates for Double Phase Obstacle Problems with Clarke’s Subdifferential
Numerical Functional Analysis and Optimization, 2022Võ Minh Tam
exaly