Cutwidth of the r-dimensional Mesh 
of d-ary Trees

Imrich Vrťo

Displaying similar documents to “Cutwidth of the r-dimensional Mesh of d-ary Trees”

On the asymptotic properties of a simple estimate of the Mode

Christophe Abraham, Gérard Biau, Benoît Cadre (2010)

ESAIM: Probability and Statistics

Similarity:

We consider an estimate of the mode of a multivariate probability density with support in $ℝ^{d}$ using a kernel estimate drawn from a sample . The estimate is defined as any in {} such that $f_{n} (x) = {max}_{i = 1, \dots, n} f_{n} (X_{i})$ . It is shown that behaves asymptotically as any maximizer ${\hat{θ}}_{n}$ of . More precisely, we prove that for any sequence ${(r_{n})}_{n \geq 1}$ of positive real numbers such that $r_{n} \to \infty$ and $r_{n}^{d} log n / n \to 0$ , one has $r_{n} ∥ θ_{n} - {\hat{θ}}_{n} ∥ \to 0$ in probability. The asymptotic normality of follows without further work.

An improved derandomized approximation algorithm for the max-controlled set problem

Carlos Martinhon, Fábio Protti (2011)

RAIRO - Theoretical Informatics and Applications

Similarity:

A vertex of a graph = () is said to be by $M \subseteq V$ if the majority of the elements of the neighborhood of (including itself) belong to . The set is a in if every vertex $i \in V$ is controlled by . Given a set $M \subseteq V$ and two graphs = ( $V, E_{1}$ ) and = ( $V, E_{2}$ ) where $E_{1} \subseteq E_{2}$ , the consists of deciding whether there exists a sandwich graph = () (, a graph where $E_{1} \subseteq E \subseteq E_{2}$ ) such that is a monopoly in = (). If the answer to the is No, we then consider the , whose objective is to find a sandwich...

An improved derandomized approximation algorithm for the max-controlled set problem

Carlos Martinhon, Fábio Protti (2011)

RAIRO - Theoretical Informatics and Applications

Similarity:

About the decision of reachability for register machines

Véronique Cortier (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We study the decidability of the following problem: given affine functions ƒ,...,ƒ over $ℕ^{k}$ and two vectors $v_{1}, v_{2} \in ℕ^{k}$ , is reachable from by successive iterations of ƒ,...,ƒ (in this given order)? We show that this question is decidable for and undecidable for some fixed .

Structure of approximate solutions of variational problems with extended-valued convex integrands

Alexander J. Zaslavski (2008)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

In this work we study the structure of approximate solutions of autonomous variational problems with a lower semicontinuous strictly convex integrand : × $\to$ $\cup$ ${\infty}$ , where is the -dimensional Euclidean space. We obtain a full description of the structure of the approximate solutions which is independent of the length of the interval, for all sufficiently large intervals.

A CAT algorithm for the exhaustive generation of ice piles

Paolo Massazza, Roberto Radicioni (2011)

RAIRO - Theoretical Informatics and Applications

Similarity:

We present a CAT (constant amortized time) algorithm for generating those partitions of that are in the ${IPM}_{k}$ (), a generalization of the $SPM$ (). More precisely, for any fixed integer , we show that the negative lexicographic ordering naturally identifies a tree structure on the lattice ${IPM}_{k}$ (): this lets us design an algorithm which generates all the ice piles of ${IPM}_{k}$ () in amortized time (1) and in space ( $\sqrt{n}$ ).