All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 3 Next

Displaying 41 – 60 of 107

Showing per page

Non literal tranducers and some problems of normality

François Blanchard (1993)

Journal de théorie des nombres de Bordeaux

A new proof of Maxfield’s theorem is given, using automata and results from Symbolic Dynamics. These techniques permit to prove that points that are near normality to base p k (resp. p ) are also near normality to base p (resp. p k ), and to study genericity preservation for non Lebesgue measures when going from one base to the other. Finally, similar results are proved to bases the golden mean and its square.

Nonlinear Tensor Diffusion in Image Processing

Stašová, Olga, Mikula, Karol, Handlovičová, Angela, Peyriéras, Nadine (2017)

Proceedings of Equadiff 14

This paper presents and summarize our results concerning the nonlinear tensor diffusion which enhances image structure coherence. The core of the paper comes from [3, 2, 4, 5]. First we briefly describe the diffusion model and provide its basic properties. Further we build a semi-implicit finite volume scheme for the above mentioned model with the help of a co-volume mesh. This strategy is well-known as diamond-cell method owing to the choice of co-volume as a diamondshaped polygon, see [1]. We...

Non-looping string rewriting

Alfons Geser, Hans Zantema (1999)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Non-Looping String Rewriting

Alfons Geser, Hans Zantema (2010)

RAIRO - Theoretical Informatics and Applications

String rewriting reductions of the form t → R + u t v , called loops, are the most frequent cause of infinite reductions (non- termination). Regarded as a model of computation, infinite reductions are unwanted whence their static detection is important. There are string rewriting systems which admit infinite reductions although they admit no loops. Their non-termination is particularly difficult to uncover. We present a few necessary conditions for the existence of loops, and thus establish a means...

Nonparametric recursive aggregation process

Elena Tsiporkova, Veselka Boeva (2004)

Kybernetika

In this work we introduce a nonparametric recursive aggregation process called Multilayer Aggregation (MLA). The name refers to the fact that at each step the results from the previous one are aggregated and thus, before the final result is derived, the initial values are subjected to several layers of aggregation. Most of the conventional aggregation operators, as for instance weighted mean, combine numerical values according to a vector of weights (parameters). Alternatively, the MLA operators...

Nonparametric statistical analysis for multiple comparison of machine learning regression algorithms

Bogdan Trawiński, Magdalena Smętek, Zbigniew Telec, Tadeusz Lasota (2012)

International Journal of Applied Mathematics and Computer Science

In the paper we present some guidelines for the application of nonparametric statistical tests and post-hoc procedures devised to perform multiple comparisons of machine learning algorithms. We emphasize that it is necessary to distinguish between pairwise and multiple comparison tests. We show that the pairwise Wilcoxon test, when employed to multiple comparisons, will lead to overoptimistic conclusions. We carry out intensive normality examination employing ten different tests showing that the...

Currently displaying 41 – 60 of 107