Results 11 to 20 of about 2,132,960 (297)
Tree Rings and Forest Mensuration: How Can They Document Trends in Forest Health and Productivity?
A workshop sponsored by the National Council of the Paper Industry for Air and Stream Improvement (NCASI) and the National Vegetation Survey - EPA/USFS Forest Response Program.
University of Arizona. Laboratory of Tree-Ring Research.
core +5 more sources
Tree compression with top trees [PDF]
We introduce a new compression scheme for labeled trees based on top trees. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast navigational queries directly on the compressed representation.
Philip Bille +3 more
openaire +4 more sources
A suffix tree or not a suffix tree? [PDF]
Full version.
Starikovskaya, Tatiana A. +1 more
openaire +5 more sources
Search trees on trees (STTs) are a far-reaching generalization of binary search trees (BSTs), allowing the efficient exploration of tree-structured domains. (BSTs are the special case in which the underlying domain is a path.) Trees on trees have been extensively studied under various guises in computer science and discrete mathematics.
Benjamin Aram Berendsohn +1 more
openaire +3 more sources
Canonical trees of tree-decompositions [PDF]
22 ...
Johannes Carmesin +2 more
openaire +2 more sources
Pairs of trees in tree–tree triangulations
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Günter Schaar, Zdzislaw Skupien
openaire +3 more sources
Fast approximation of search trees on trees with centroid trees
Search trees on trees (STTs) generalize the fundamental binary search tree (BST) data structure: in STTs the underlying search space is an arbitrary tree, whereas in BSTs it is a path. An optimal BST of size $n$ can be computed for a given distribution of queries in $O(n^2)$ time [Knuth 1971] and centroid BSTs provide a nearly-optimal alternative ...
Berendsohn, Benjamin Aram +3 more
openaire +4 more sources
Tree in Tree: from Decision Trees to Decision Graphs
Decision trees have been widely used as classifiers in many machine learning applications thanks to their lightweight and interpretable decision process. This paper introduces Tree in Tree decision graph (TnT), a framework that extends the conventional decision tree to a more generic and powerful directed acyclic graph.
Zhu, Bingzhao, Shoaran, Mahsa
openaire +4 more sources
Tree-Rings and Sunspot Numbers
Tree-ring series that record climatic variation have long been of interest for study of possible effects of solar variability on terrestrial phenomena.
LaMarche, Valmore C., Jr. +1 more
core +4 more sources
Tree contractions and evolutionary trees [PDF]
An evolutionary tree is a rooted tree where each internal vertex has at least two children and where the leaves are labeled with distinct symbols representing species. Evolutionary trees are useful for modeling the evolutionary history of species.
openaire +4 more sources

