Displaying similar documents to “On the Stack-Size of General Tries”

Morphospace: Measurement, Modeling, Mathematics, and Meaning

N. Khiripet, R. Viruchpintu, J. Maneewattanapluk, J. Spangenberg, J.R. Jungck (2010)

Mathematical Modelling of Natural Phenomena

Similarity:

Artists have long recognized that trees are self-similar across enormous differences in magnitudes; i.e., they share a common fractal structure - a trunk subdivides into branches which subdivide into more branches which eventually terminate in leaves, flowers, fruits, etc. Artistid Lindenmayer (1971, 1975, 1989, 1990) invented a mathematics based on graph grammar rewriting systems to describe such iteratively branching structures; these were named in honor of him and are referred to...

Tree inclusion problems

Patrick Cégielski, Irène Guessarian, Yuri Matiyasevich (2008)

RAIRO - Theoretical Informatics and Applications

Similarity:

Given two trees (a target and a pattern ) and a natural number , consist in deciding whether occurs as an embedded subtree of and/or finding the number of size (at most) windows of which contain pattern as an embedded subtree. is an embedded subtree of if can be obtained by deleting some nodes from (if a node is deleted, all edges adjacent to are also deleted, and outgoing edges are replaced by edges going from the parent of (if it exists) to the children of ). Deciding...

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

Classification of Paintings by Artist, Movement, and Indoor Setting Using MPEG-7 Descriptor Features

Welch, Charles (2014)

Serdica Journal of Computing

Similarity:

ACM Computing Classification System (1998): I.4.9, I.4.10. Image classification is an essential problem for content based image retrieval and image processing. Visual properties can be extracted from images in the form of MPEG-7 descriptors. Statistical methods can use these properties as features and be used to derive an effective method of classifying images by evaluating a minimal number of properties used in the MPEG-7 descriptor. Classification by artist, artistic movement,...

The triangles method to build -trees from incomplete distance matrices

Alain Guénoche, Bruno Leclerc (2010)

RAIRO - Operations Research

Similarity:

A method to infer -trees (valued trees having 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-3 distance values between the elements of , if they fulfill some explicit conditions. This construction is based on the mapping between -tree and a weighted generalized 2-tree spanning .