Computer Modeling of Landscapes

Jelena Petrić

Displaying similar documents to “Computer Modeling of Landscapes”

A plane model of the bronchial tree.

Zeitler, Herbert, Krämer, Alexander (2006)

Mathematica Pannonica

Similarity:

Variability of the radius growth at 25 year old Pinus uncinata miller ex mirbel species in the Spanish north-east pyrenees.

Emilia Gutiérrez (1985)

Qüestiió

Similarity:

It has been studied the variability of stem radial growth in four radius orientations at the age of 25 years old trees. The species was Pinus uncinata. The sampling sites, located in the North East Spanish Pyrenees belong to different plant communities. An ANOVA analysis was performed in order to find out which factors, the radio orientation, plant community of the site and tree itself are significative or have some kind of influence on the tree radial growth.

Plane trivalent trees and their patterns

Charles Delorme (2010)

Open Mathematics

Similarity:

The aim of this paper is to characterize the patterns of successive distances of leaves in plane trivalent trees, and give a very short characterization of their parity pattern. Besides, we count how many trees satisfy some given sequences of patterns.

Thompson's group $F (n)$ is not minimally almost convex.

Wladis, Claire (2007)

The New York Journal of Mathematics [electronic only]

Similarity:

Multidimensional term indexing for efficient processing of complex queries

Michal Krátký, Tomáš Skopal, Václav Snášel (2004)

Kybernetika

Similarity:

The area of Information Retrieval deals with problems of storage and retrieval within a huge collection of text documents. In IR models, the semantics of a document is usually characterized using a set of terms. A common need to various IR models is an efficient term retrieval provided via a term index. Existing approaches of term indexing, e. g. the inverted list, support efficiently only simple queries asking for a term occurrence. In practice, we would like to exploit some more sophisticated...

Mutating seeds: types $𝔸$ and $\tilde{𝔸}$ .

Ibrahim Assem, Christophe Reutenauer (2012)

Annales mathématiques Blaise Pascal

Similarity:

In the cases $𝔸$ and $\tilde{𝔸}$ , we describe the seeds obtained by sequences of mutations from an initial seed. In the $\tilde{𝔸}$ case, we deduce a linear representation of the group of mutations which contains as matrix entries all cluster variables obtained after an arbitrary sequence of mutations (this sequence is an element of the group). Nontransjective variables correspond to certain subgroups of finite index. A noncommutative rational series is constructed, which contains all this information. ...

NP-completeness of minimal width unordered tree layout.

Marriott, Kim, Stuckey, Peter J. (2004)

Journal of Graph Algorithms and Applications

Similarity:

Bijective counting of tree-rooted maps and shuffles of parenthesis systems.

Bernardi, Olivier (2007)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

The triangles method to build $X$ -trees from incomplete distance matrices

Alain Guénoche, Bruno Leclerc (2001)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

A method to infer $X$ -trees (valued trees having $X$ as set of leaves) from incomplete distance arrays (where some entries are uncertain or unknown) is described. It allows us to build an unrooted tree using only 2 $n$ -3 distance values between the $n$ elements of $X$ , if they fulfill some explicit conditions. This construction is based on the mapping between $X$ -tree and a weighted generalized 2-tree spanning $X$ .