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 4

Displaying 61 – 79 of 79

Showing per page

Rough modeling - a bottom-up approach to model construction

Terje Loken, Jan Komorowski (2001)

International Journal of Applied Mathematics and Computer Science

Traditional data mining methods based on rough set theory focus on extracting models which are good at classifying unseen obj-ects. If one wants to uncover new knowledge from the data, the model must have a high descriptive quality-it must describe the data set in a clear and concise manner, without sacrificing classification performance. Rough modeling, introduced by Kowalczyk (1998), is an approach which aims at providing models with good predictive emphand descriptive qualities, in addition to...

Tamaño medio de árboles simplificados.

María Inés Fernández Camacho (1987)

Qüestiió

Estudiamos la media y la varianza del tamaño de los árboles simplificados obtenidos a partir de árboles p-arios y generales. Se demuestra que ambos parámetros son lineales en el tamaño del input. Pero lo que creemos más interesante del artículo es la metodología seguida, que pensamos podría aplicarse al análisis de gran parte de algoritmos de simplificación sobre árboles. Tal técnica involucra un estudio de ciertas series de potencias formales, y la aplicación del teorema de Darboux-Polya para aproximaciones...

The factor automaton

Milan Šimánek (2002)

Kybernetika

This paper concerns searching substrings in a string using the factor automaton. The factor automaton is a deterministic finite automaton constructed to accept every substring of the given string. Nondeterministic factor automaton is used to achieve new operations on factor automata for searching in non-constant texts.

Uniform distribution modulo one and binary search trees

Michel Dekking, Peter Van der Wal (2002)

Journal de théorie des nombres de Bordeaux

Any sequence x = ( x k ) k = 1 ∞ of distinct numbers from [0,1] generates a binary tree by storing the numbers consecutively at the nodes according to a left-right algorithm (or equivalently by sorting the numbers according to the Quicksort algorithm). Let H n ( x ) be the height of the tree generated by x 1 , ⋯ , x n . Obviously log n log 2 - 1 ≤ H n ( x ) ≤ n - 1 . If the sequences x are generated by independent random variables having the uniform distribution on [0, 1], then it is well known that there exists c > 0 such that H n ( x ) ∼ c log n as n → ∞ for almost all sequences x . Recently...

Currently displaying 61 – 79 of 79

Previous Page 4