Results 11 to 20 of about 1,110,706 (305)
Thought Experiments in Graphic Design Education
, 2013 What happens when we look at graphic design education as a ‘thought experiment’? Thought Experiments in Graphic Design Education documents an international mix of experimental, reflexive and speculative projects made by students, educators and ...
Trees, Joshua, Martinez, Yvan
core +5 more sources
Tree compression with top trees [PDF]
Information and Computation, 2013 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]
Journal of Discrete Algorithms, 2015 Full version.
Starikovskaya, Tatiana A. +1 more
openaire +5 more sources
Canonical trees of tree-decompositions [PDF]
Journal of Combinatorial Theory, Series B, 2022 22 ...
Johannes Carmesin +2 more
openaire +2 more sources
, 2022 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
Pairs of trees in tree–tree triangulations
Discrete Mathematics, 2007 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
CoRR, 2022 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
CoRR, 2021 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
, 2015 Model tree induction is a popular method for tackling regression problems requiring interpretable models. Model trees are decision trees with multiple linear regression models at the leaf nodes.
Kramer, Stefan +5 more
core +1 more source
, 2019 All of the phylogenetic trees relevant to this ...
John M. Pfeiffer (6398033) +2 more
core +3 more sources