The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 621 –
640 of
4973
Pólya processes are natural generalizations of Pólya–Eggenberger urn models. This article presents a new approach of their asymptotic behaviour via moments, based on the spectral decomposition of a suitable finite difference transition operator on polynomial functions. Especially, it provides new results for large processes (a Pólya process is called small when 1 is a simple eigenvalue of its replacement matrix and when any other eigenvalue has a real part ≤1/2; otherwise, it is called large).
For polyominoes coded by their boundary word, we describe a quadratic O(n2) algorithm in the boundary length n which improves the naive O(n4) algorithm. Techniques used emanate from algorithmics, discrete geometry and combinatorics on words.
Let us have a system of variables, among which there are complicated dependences. Assuming reflexivity and transitivity of the relation " depends on ", a simple algorithm is proposed which produces all dependences in an optimized way, without losing information.
ACM Computing Classification System (1998): J.3.Automated and semi-automated mapping and the subsequently
merging of two (or more) anatomical ontologies can be achieved by (at least)
two direct procedures.
The first concerns syntactic matching between the terms of the two ontologies; in this paper, we call this direct matching (DM). It relies on identities
between the terms of the two input ontologies in order to establish cross-ontology links between them.
The second involves consulting one or...
Currently displaying 621 –
640 of
4973