Results 291 to 300 of about 6,228,748 (341)
Some of the next articles are maybe not open access.

Strong Consistency in Nonlinear Regression

Econometric Theory, 1990
Sufficient conditions are given to ensure the existence of a sequence of strongly consistent estimators of an unknown parameter for a nonlinear regression model. The parameter space includes all separable metric spaces but is not assumed to be compact.
Richardson, G. D., Bhattacharyya, B. B.
openaire   +2 more sources

Exact and Strong Consistency

1991
In the previous chapter, we have considered the problem of implementing a given social choice correspondence in strong Nash equilibria. In order to do this, we had to find a game form such that at each profile, the set of strong Nash equilibria of the resulting game coincided with the values of the social choice correspondence at this profile.
J. Abdou, H. Keiding
openaire   +1 more source

Uniform strong consistency of robust estimators

Statistics & Probability Letters, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Strong universal consistency of neural network classifiers

IEEE Transactions on Information Theory, 1993
Summary: In statistical pattern recognition a classifier is called universally consistent if its error probability converges to the Bayes-risk as the size of the training data grows, for all possible distributions of the random variable pair of the observation vector and its class.
Faragó, András, Lugosi, Gábor
openaire   +1 more source

Strong cache consistency in integration systems

2010 International Conference on Mechanical and Electrical Technology, 2010
Nowadays, a common problem to which many corporations or organizations face is how to easily and uniformly access over multiple, disparate information sources which includes database, object store, knowledge bases, file system, digital libraries, information retrieval system, and electronic mail system.
null Zhang Wei, null Xiong Yongchun
openaire   +1 more source

Kernel estimates under association: strong uniform consistency

Statistics & Probability Letters, 1991
A strictly stationary process \(X_ 1,X_ 2,\dots\) is called associated if for any functions \(g_ 1,g_ 2\), increasing in each variable, the r.v. \(g_ 1(X_{i_ 1},\dots,X_{i_ n})\), \(g_ 2(X_{i_ 1},\dots,X_{i_ n})\) are positively correlated for any choice of \(X_{i_ 1},\dots,X_{i_ n}\).
openaire   +2 more sources

Strong consistency of FSD detection schemes

[1991] Conference Record of the Twenty-Fifth Asilomar Conference on Signals, Systems & Computers, 2002
Recently, a fast signal subspace decomposition technique (FSD) suitable for parallel processing which achieves a significant reduction in computational complexity for large arrays with few sources was developed. Two new detection schemes used in conjunction with the FSD algorithm are presented.
G. Xu, R.H. Roy, T. Kailath
openaire   +1 more source

Strong consistency under the Koziol—Green model

Statistics & Probability Letters, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Strong, Balanced, and Consistent Lattices

1991
FAIGLE [1980 b] introduced the notion of a strong join-irreducible in lattices of finite length (s. Definition 16.2 below). Using the concepts a′ and a+ (s. Section 10) we present two extensions of Faigle’s concept of a strong join-irreducible, namely the notion of a strong element and the notion of a strict element.
openaire   +1 more source

Uniform strong consistency of sample quantiles

Statistics & Probability Letters, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Home - About - Disclaimer - Privacy