Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 62 for “"Binary Trees"”.

  1. Comparison of Binary Trees

    The tree structures are getting more and more important in the modern computer systems. Especially in the file organization systems, it can make the data access or updating powerful and efficient. This paper presents the algorithm to organize and maintain the different tree structures. These …

    marquette Repository record for Comparison of Binary Trees (opens in a new tab)

  2. A New View of Binary Trees

    We present a new formalism of labelled binary trees, using two partial binary constructors instead of the usual total ternary constructor. This formalism is complemented by some higher-order operators, encapsulating common patterns of computation on trees. We explore their use by deriving solutions …

    oxford Restricted access

  3. Algorithms for embedding binary trees into hypercubes

    … empirically using hypercube host graphs and binary tree guest graphs. These families of graphs are interesting because of the existence of both heuristic techniques and theoretical algorithms for this problem. Although for general trees the problem is N P-complete, for binary trees the …

    ubc Repository record for Algorithms for embedding binary trees into hypercubes (opens in a new tab) Download PDF for Algorithms for embedding binary trees into hypercubes (opens in a new tab)

  4. Ordering and Self-Similarity in Non-Binary Trees

    Ordering and self-similarity in binary trees has been well-studied. Self-similarity was first observed in river networks, and has since been shown to have many useful properties and modeling applications, from leaf vein structures to level-set trees of symmetric Markov chains. Systems for assigning …

    unr Repository record for Ordering and Self-Similarity in Non-Binary Trees (opens in a new tab)

  5. Some new results on constructing optimal alphabetic binary trees

    … the question of whether optimal alphabetic binary trees can be constructed in o(n lg n) time. Hu and Tucker [1] gave the first subquadratic algorithm in 1971, namely an O(n lg n) time algorithm. Optimal alphabetic binary trees have many applications and the question of whether an o(n lg n) …

    ubc Repository record for Some new results on constructing optimal alphabetic binary trees (opens in a new tab) Download PDF for Some new results on constructing optimal alphabetic binary trees (opens in a new tab)

  6. Finding Paths in the Rotation Graph of Binary Trees

    A binary tree coding scheme is a bijection mapping a set of binary trees to a set of integer tuples called codewords. One problem considered in the literature is that of listing the codewords for n-node binary trees, such that successive codewords represent trees differing by a single rotation, a …

    ucf Repository record for Finding Paths in the Rotation Graph of Binary Trees (opens in a new tab)

  7. Visualizing graphs with distinguishable edges and ordered binary trees in small area

    … straight-line order-preserving grid drawings of binary trees is presented in a novel algorithm using a separations approach. The new bounds are optimal in area and aspect ratio, where the optimum values are linear and 1:1 respectively. All three topics present novel contributions to graph and …

    rowan Repository record for Visualizing graphs with distinguishable edges and ordered binary trees in small area (opens in a new tab)

  8. Irreducibility of Random Hilbert Schemes

    … this set into a disjoint union of infinite binary trees, reinterpreting Macaulay's classification of admissible Hilbert polynomials. Choosing discrete probability distributions with infinite support on the trees establishes our notion of random Hilbert schemes. To bound the probability that …

    queens Repository record for Irreducibility of Random Hilbert Schemes (opens in a new tab)

  9. Subtree transfer operations on phylogenetic networks

    <p>Leaf-labelled, rooted binary trees can be used to represent a wide range of data. One way to measure the discrepancy between a pair of such trees, is to measure how many subtree transfer operations are required to transform one into the other. Four standard subtree transfer oper- ations for …

    oxford Repository record for Subtree transfer operations on phylogenetic networks (opens in a new tab)

  10. On the coarse geometry of solvable Baumslag-Solitar groups and relatively hyperbolic groups

    … metric space into a product of infinite-valence trees and upgrade it to a quasiisometric embedding into a product of binary trees.</p> <p>Consequently, in the final chapter, we use diaries and linear statistics to prove that if a group G is relatively hyperbolic with respect to virtually abelian …

    oxford Repository record for On the coarse geometry of solvable Baumslag-Solitar groups and relatively hyperbolic groups (opens in a new tab)

  11. Tangled up in Tanglegrams

    Tanglegrams are graphs consisting of two rooted binary plane trees with the same number of leaves and a perfect matching between the two leaf sets. A Tanglegram drawing is a special way of drawing a Tanglegram; and a Tanglegram is called planar if it has a drawing such that the matching edges do …

    south-carolina Repository record for Tangled up in Tanglegrams (opens in a new tab)

  12. A data structure for interactive graphic manipulation of logic diagrams

    … system. The use of sequential list, hashing, binary tree, and linked list data structures are evaluated, and the data structure is formulated, which includes a combination of linked lists, binary trees, and sequential lists. An illustrative example is presented, along with recommendations for …

    vt Repository record for A data structure for interactive graphic manipulation of logic diagrams (opens in a new tab)

  13. Dokumentų analizė ir atpažinimas /

    … of array representations of document layout binary trees, retrieved information is formatted and validated using pipelines. “JSON” is used to represent digitalization results. Suggested algorithms and methods are more effective and more reliable than those used in complex document …

    vilnius Repository record for Dokumentų analizė ir atpažinimas / (opens in a new tab)

  14. A visualization tool for recursive linked structures generated by Korat

    … linked data structures, such as linked lists and binary trees, which are commonly used in Java libraries and are standard examples for the Korat tool.

    texas Repository record for A visualization tool for recursive linked structures generated by Korat (opens in a new tab)

  15. Ordered tree generation algorithms

    Algorithms have been created for generating all binary trees with n nodes, all k-ary trees with n nodes all ordered trees with n nodes, and all ordered trees with a particular degree sequence A survey of these ordered tree generation algorithms is presented here. Two natural orderings [25] are …

    uvic Repository record for Ordered tree generation algorithms (opens in a new tab)

  16. Combinatorics of Trees via Derivatives of Polynomial Functors in Homotopy Type Theory

    … inductively defined data types as wellfounded trees; second, polynomial functors have a notion of derivative which, viewed in light of the connection to data types, yields a computational interpretation of differentiation; and third, suitably finite polynomial functors over (higher) groupoids …

    boise Repository record for Combinatorics of Trees via Derivatives of Polynomial Functors in Homotopy Type Theory (opens in a new tab)

  17. Efficient Algorithms for the Gene Tree-Species Tree Reconciliation Problem

    … motivated by the fact that reference species trees and real gene trees are often non-binary, we investigate various issues of reconciliation for non-binary trees. We first design efficient algorithms for the gene tree refinement problem in different reconciliation models. We then study the …

    nus Repository record for Efficient Algorithms for the Gene Tree-Species Tree Reconciliation Problem (opens in a new tab) Download file for Efficient Algorithms for the Gene Tree-Species Tree Reconciliation Problem (opens in a new tab)

  18. Distortion Lower Bounds for Graph Embeddings in the Style of Matoušek

    … to give optimal lower bounds for embedding binary trees into generalized Heisenberg groups over p-uniformly convex Banach spaces. Additionally, we derive new proofs of known lower bounds on embedding countably branching trees and countably branching diamonds. In the case of countably …

    tamu Repository record for Distortion Lower Bounds for Graph Embeddings in the Style of Matoušek (opens in a new tab)

  19. Fine Polyhedral Adjunction, Weighted Ehrhart Theory, and Tensor Network Varieties

    … structures such as lattice polytopes, and binary trees, their interaction with (toric) algebraic geometry and classification problems from a combinatorial point of view. In the Introduction presented in Chapter 1 we begin by collecting all the main results from this work and describe their …

    fu-berlin Repository record for Fine Polyhedral Adjunction, Weighted Ehrhart Theory, and Tensor Network Varieties (opens in a new tab)

  20. On characterizing optimal Boolean circuits and their applications

    … $n$-bit $\XOR$-function) are ``shaped like'' binary trees of $(n - 1)$ $\XOR_2$-subcircuits, matching Schnorr's classical $3(n-1)$ lower bound. Furthermore, we adapt our technique with optimal $\XOR$-circuits to also characterize optimal circuit structure for the equality testing function …

    bu Repository record for On characterizing optimal Boolean circuits and their applications (opens in a new tab)

Page 1 of 4