Als einfaches Beispiel für ein programmiertes Spiel können wir unsüberlegen, wie ein Algorithmus für das bekannte Spiel " Papier-Schere-Stein " (Schnick-Schnack-Schnuck) aussehen könnte. Das Spiel funktioniert so: Bei jeder Spielrunde wählst Du eine der drei Möglichkeiten " Papier " , " Schere " oder " Stein ". Dann wird der Algorithmus ausgeführt und liefert als Ergebnis ebenfalls " Papier " o...

Suppose that X has a k -variate spherically symmetric distribution with mean vector θ and identity covariance matrix. We present two spherical confidence sets for θ, both centred at a positive part Stein estimator T C S .X/. In the first, we obtain the radius by approximating the upper α-point of the sampling distribution of kT C S .X/ θk2 by the first two non-zero terms of its Taylor series ab...

The present work addresses binary classification by use of the k-nearest neighbors (kNN) classifier. Among several assets, it belongs to intuitive majority vote classification rules and also adapts to spatial inhomogeneity, which is particularly relevant in high dimensional settings where no a priori partitioning of the space seems realistic. However the performance of the kNN classifier crucia...

We propose a best basis algorithm for signal enhancement in white Gaussian noise. The best basis search is performed in families of orthonormal bases constructed with wavelet packets or local cosine bases. We base our search for the “best” basis on a criterion of minimal reconstruction error of the underlying signal. This approach is intuitively appealing because the enhanced or estimated signa...

A surjective holomorphic map Π : X → Y between complex spaces is said to be a Stein morphism, if for every point y ∈ Y , there exists an open neighborhood U of y such that Π(U) is Stein. In 1977, Skoda [12] showed that a locally trivial analytic fiber bundle Π : X → Ω with Stein base and Stein fibers is not necessarily a Stein manifold. Thus giving a negative answer to a conjecture proposed in ...