The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying 361 – 380 of 924

Showing per page

A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata

Rafael C. Carrasco, Jan Daciuk (2009)

RAIRO - Theoretical Informatics and Applications

We describe a technique that maps unranked trees to arbitrary hash codes using a bottom-up deterministic tree automaton (DTA). In contrast to other hashing techniques based on automata, our procedure builds a pseudo-minimal DTA for this purpose. A pseudo-minimal automaton may be larger than the minimal one accepting the same language but, in turn, it contains proper elements (states or transitions which are unique) for every input accepted by the automaton. Therefore, pseudo-minimal DTA...

A periodicity property of iterated morphisms

Juha Honkala (2007)

RAIRO - Theoretical Informatics and Applications

Suppose ƒ : X* → X* is a morphism and u,v ∈ X*. For every nonnegative integer n, let zn be the longest common prefix of ƒn(u) and ƒn(v), and let un,vn ∈ X* be words such that ƒn(u) = znun and ƒn(v) = znvn. We prove that there is a positive integer q such that for any positive integer p, the prefixes of un (resp. vn) of length p form an ultimately periodic sequence having period q. Further, there is a value of q which works for all words u,v ∈ X*.

A Prototype of an Extension to the UDDI Registry Allowing Pubilcation and Search Based on Subjective Evaluations

Mintchev, Alexander (2007)

Serdica Journal of Computing

The paper has been presented at the International Conference Pioneers of Bulgarian Mathematics, Dedicated to Nikola Obreshko and Lubomir Tschakalo , So a, July, 2006.The current paper introduces the usage of subjective evaluations by others as a tool that can support consumers' decisions. It summarizes the features of the main UDDI registry providers and presents an extension to any UDDI registry allowing users of the registry to publish subjective evaluations for any artifact found in it and to...

A proximity based macro stress testing framework

Boris Waelchli (2016)

Dependence Modeling

In this a paper a non-linear macro stress testing methodology with focus on early warning is developed. The methodology builds on a variant of Random Forests and its proximity measures. It is embedded in a framework, in which naturally defined contagion and feedback effects transfer the impact of stressing a relatively small part of the observations on the whole dataset, allowing to estimate a stressed future state. It will be shown that contagion can be directly derived from the proximities while...

Currently displaying 361 – 380 of 924