feel that the results we show, particularly in Figure 6, are on much more complex examples and that we have processed much larger number of buildings than reported in the previous literature ([5], [2], and [9]). We feel that our method has advantage over monocular systems such as ([5]) due to its ability to infer 3-D more directly and of having several views to validate the hypotheses. We feel ...

Although game-tree search works well in perfect-information games, it is less suitable for imperfect-information games such as contract bridge. The lack of knowledge about the opponents' possible moves gives the game tree a very large branching factor, making it impossible to search a signiicant portion of this tree in a reasonable amount of time. This paper describes our approach for overcomin...

Supramolecule self assembly polyamidoamine (PAMAM) dendrimer refers to the chemical systems made up of a discrete number of assembled molecular subunits or components. These strategies involve the covalent assembly of hierarchical components reactive monomers, branch cells or dendrons around atomic or molecular cores according to divergent/convergent dendritic branching principles, systematic f...

Understanding the complex growth process of dendritic arbors is essential for the medical field and disciplines like Biology and Neurosciences. The establishment of the dendritic patterns has received increasing attention from experimental researchers that seek to determine the cellular mechanisms that play a role in the growth of neural trees. Our goal in this thesis was to prove the recurrenc...

The Randić index, R, also known as the connectivity or branching index, is an important topological index in chemistry. In order to attack some conjectures concerning the Randić index, Dvořák et al. [European J. Combin. 32 (2011), 434–442] introduced a modification of this index, denoted by R′. In this paper we present some of the basic properties of R′. We determine graphs with minimal and max...

We present a construction of a Lévy continuum random tree (CRT) associated with a super-critical continuous state branching process using the so-called exploration process and a Girsanov theorem. We also extend the pruning procedure to this super-critical case. Let ψ be a critical branching mechanism. We set ψθ(·) = ψ(·+ θ)− ψ(θ). Let Θ = (θ∞,+∞) or Θ = [θ∞,+∞) be the set of values of θ for whi...

Ephemeral roots have essential roles in plant and ecosystem functioning. In forests, roots account for a major component of carbon cycling, yet few studies have examined ranges of root trait variation and how different species vary in root form and function in these communities. Root branching intensity, specific root length (SRL; root length per unit dry mass), root diameter, tissue density, p...

In this paper, we study the structure of set-multilinear arithmetic circuits and set-multilinear branching programs with the aim of showing lower bound results. We define some natural restrictions of these models for which we are able to show lower bound results. Some of our results extend existing lower bounds, while others are new and raise open questions. Specifically, our main results are t...

Random variables with Mittag-Leffler distribution can take values either in the set of non-negative integers or in the positive real line. There can be of two different types, one (type-1) heavy-tailed with index α ∈ (0, 1), the other (type-2) possessing all its moments. We investigate various stochastic processes where they play a key role, among which: the discrete space/time Neveu branching ...