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 5 Next

Displaying 81 – 100 of 119

Showing per page

Uniform a priori estimates for discrete solution of nonlinear tensor diffusion equation in image processing

Olga Drblíková (2007)

Kybernetika

This paper concerns with the finite volume scheme for nonlinear tensor diffusion in image processing. First we provide some basic information on this type of diffusion including a construction of its diffusion tensor. Then we derive a semi-implicit scheme with the help of so-called diamond-cell method (see [Coirier1] and [Coirier2]). Further, we prove existence and uniqueness of a discrete solution given by our scheme. The proof is based on a gradient bound in the tangential direction by a gradient...

Uniform deterministic equivalent of additive functionals and non-parametric drift estimation for one-dimensional recurrent diffusions

D. Loukianova, O. Loukianov (2008)

Annales de l'I.H.P. Probabilités et statistiques

Usually the problem of drift estimation for a diffusion process is considered under the hypothesis of ergodicity. It is less often considered under the hypothesis of null-recurrence, simply because there are fewer limit theorems and existing ones do not apply to the whole null-recurrent class. The aim of this paper is to provide some limit theorems for additive functionals and martingales of a general (ergodic or null) recurrent diffusion which would allow us to have a somewhat unified approach...

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...

Uniformly bounded duplication codes

Peter Leupold, Victor Mitrana (2007)

RAIRO - Theoretical Informatics and Applications

Duplication is the replacement of a factor w within a word by ww. This operation can be used iteratively to generate languages starting from words or sets of words. By undoing duplications, one can eventually reach a square-free word, the original word's duplication root. The duplication root is unique, if the length of duplications is fixed. Based on these unique roots we define the concept of duplication code. Elementary properties are stated, then the conditions under which infinite duplication...

Unique decipherability in the additive monoid of sets of numbers

Aleksi Saarela (2011)

RAIRO - Theoretical Informatics and Applications

Sets of integers form a monoid, where the product of two sets A and B is defined as the set containing a+b for all a ∈ A and b ∈ B . We give a characterization of when a family of finite sets is a code in this monoid, that is when the sets do not satisfy any nontrivial relation. We also extend this result for some infinite sets, including all infinite rational sets.

Unique decipherability in the additive monoid of sets of numbers

Aleksi Saarela (2011)

RAIRO - Theoretical Informatics and Applications

Sets of integers form a monoid, where the product of two sets A and B is defined as the set containing a+b for all a ∈ A and b ∈ B . We give a characterization of when a family of finite sets is a code in this monoid, that is when the sets do not satisfy any nontrivial relation. We also extend this result for some infinite sets, including all infinite rational sets.

Unit rectangle visibility graphs.

Dean, Alice M., Ellis-Monaghan, Joanna A., Hamilton, Sarah, Pangborn, Greta (2008)

The Electronic Journal of Combinatorics [electronic only]

Universality of Reversible Hexagonal Cellular Automata

Kenichi Morita, Maurice Margenstern, Katsunobu Imai (2010)

RAIRO - Theoretical Informatics and Applications

We define a kind of cellular automaton called a hexagonal partitioned cellular automaton (HPCA), and study logical universality of a reversible HPCA. We give a specific 64-state reversible HPCA H1, and show that a Fredkin gate can be embedded in this cellular space. Since a Fredkin gate is known to be a universal logic element, logical universality of H1 is concluded. Although the number of states of H1 is greater than those of the previous models of reversible CAs having universality,...

Currently displaying 81 – 100 of 119