Our topic is the potential of combining global gamut mapping with spatial methods to retain the percepted local image information in gamut mapping algorithms. The main goal is to recover the originalâ€¦ (More)

We consider a sequence of integer{valued random variables Xn; n 1; representing a special Markov process with transition probability the transition probability is given by n;` = q n+`+ and n;` = 1 ?â€¦ (More)

Two edges are called P 4-adjacent if they belong to the same P 4 (chordless path on 4 vertices). P 4-components, in our terminology, are the equivalence classes of the transitive closure of the Pâ€¦ (More)

To estimate the development of prevalence rates for overweight and obesity in children starting school in Germany, data for childrenâ€™s height and weight out of the compulsory school enrolmentâ€¦ (More)

For a graph G = (V; E) its line graph L(G) has the node set E and two nodes of L(G) are adjacent if the corresponding edges of G have a common endpoint. The problem of nding G for a given L wasâ€¦ (More)

The recognition of threshold graphs, those graphs with threshold dimension one, is well understood and some linear time algorithms are known for this problem. On the other hand, YANNAKAKIS provedâ€¦ (More)

Analyses of 21 N stable isotope tracer experiments, designed to examine food web dynamics in streams around the world, indicated that the isotopic composition of food resources assimilated by primaryâ€¦ (More)

In the usual Gn;p{model of a random acyclic digraph let n (1) be the size of the reeexive, transitive closure of node 1, a source node; then the distribution of n (1) is given by where q = 1 ? p. Ourâ€¦ (More)