Displaying 201 – 220 of 384

Showing per page

The theorem of Fine and Wilf for relational periods

Vesa Halava, Tero Harju, Tomi Kärki (2009)

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

We consider relational periods, where the relation is a compatibility relation on words induced by a relation on letters. We prove a variant of the theorem of Fine and Wilf for a (pure) period and a relational period.

The theorem of Fine and Wilf for relational periods

Vesa Halava, Tero Harju, Tomi Kärki (2008)

RAIRO - Theoretical Informatics and Applications

We consider relational periods, where the relation is a compatibility relation on words induced by a relation on letters. We prove a variant of the theorem of Fine and Wilf for a (pure) period and a relational period.

The tree of shapes of an image

Coloma Ballester, Vicent Caselles, P. Monasse (2003)

ESAIM: Control, Optimisation and Calculus of Variations

In [30], Kronrod proves that the connected components of isolevel sets of a continuous function can be endowed with a tree structure. Obviously, the connected components of upper level sets are an inclusion tree, and the same is true for connected components of lower level sets. We prove that in the case of semicontinuous functions, those trees can be merged into a single one, which, following its use in image processing, we call “tree of shapes”. This permits us to solve a classical representation...

The tree of shapes of an image

Coloma Ballester, Vicent Caselles, P. Monasse (2010)

ESAIM: Control, Optimisation and Calculus of Variations

In [CITE], Kronrod proves that the connected components of isolevel sets of a continuous function can be endowed with a tree structure. Obviously, the connected components of upper level sets are an inclusion tree, and the same is true for connected components of lower level sets. We prove that in the case of semicontinuous functions, those trees can be merged into a single one, which, following its use in image processing, we call “tree of shapes”. This permits us to solve a classical representation problem...

The UD RLS algorithm for training feedforward neural networks

Jarosław Bilski (2005)

International Journal of Applied Mathematics and Computer Science

A new algorithm for training feedforward multilayer neural networks is proposed. It is based on recursive least squares procedures and U-D factorization, which is a well-known technique in filter theory. It will be shown that due to the U-D factorization method, our algorithm requires fewer computations than the classical RLS applied to feedforward multilayer neural network training.

The Uniform Minimum-Ones 2SAT Problem and its Application to Haplotype Classification

Hans-Joachim Böckenhauer, Michal Forišek, Ján Oravec, Björn Steffen, Kathleen Steinhöfel, Monika Steinová (2010)

RAIRO - Theoretical Informatics and Applications

Analyzing genomic data for finding those gene variations which are responsible for hereditary diseases is one of the great challenges in modern bioinformatics. In many living beings (including the human), every gene is present in two copies, inherited from the two parents, the so-called haplotypes. In this paper, we propose a simple combinatorial model for classifying the set of haplotypes in a population according to their responsibility for a certain genetic disease. This model is based...

Currently displaying 201 – 220 of 384