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 6 of 6 for “"generalized tree"”.

  1. From tree patterns to generalized tree patterns : on efficient evaluation of XQuery

    … for efficient query evaluation, and the Tree Algebra for XML (TAX), among others, is invented for this purpose. It can be shown in this thesis that a substantial subset of XQuery can be expressed as TAX. An XML document is often modelled as an ordered label tree. A core operation in the …

    ubc Repository record for From tree patterns to generalized tree patterns : on efficient evaluation of XQuery (opens in a new tab) Download PDF for From tree patterns to generalized tree patterns : on efficient evaluation of XQuery (opens in a new tab)

  2. Implementation of a testing and initialization algorithm for the generalized tree structure

    … faults occurring within the structure of a generalized tree using, as the testing machines, a set of generalized sequential trees. It is shown that the testing machine can be implemented on a set of trees of the same depth as that of the tree which is being tested. Modifications are made to …

    vt Repository record for Implementation of a testing and initialization algorithm for the generalized tree structure (opens in a new tab)

  3. Graev Metrics and Isometry Groups of Polish Ultrametric Spaces

    … spaces are characterized. The notion of generalized tree is defined and a correspondence between the isomorphism group of a generalized tree and the isometry group of a Heine-Borel Polish ultrametric space is established. The concept of a weak inverse limit is introduced to capture the …

    unt Repository record for Graev Metrics and Isometry Groups of Polish Ultrametric Spaces (opens in a new tab)

  4. Phylogenetic Trees and Their Analysis

    … history, the lowest-cost phylogenetic tree, to fit a given set of taxa and character sequences using maximum parsimony is an active area of research due to its underlying importance in understanding biological processes. As several steps in this process are NP-Hard when using popular, …

    cuny-grad Repository record for Phylogenetic Trees and Their Analysis (opens in a new tab)

  5. Runtime Systems for Extreme Scale Platforms

    … We use the phaser construct to present a generalized tree-based synchronization algorithm and support unified collective operations at both inter-node and intra-node levels. Overcoming these runtime challenges are a first step towards effective programming on extreme-scale systems.

    rice Repository record for Runtime Systems for Extreme Scale Platforms (opens in a new tab)

  6. Use of the LDPC codes Over the Binary Erasure Multiple Access Channel

    … algorithms: 1- Standard Belief Propagation 2- Generalized tree-expected propagation 3- Guessing algorithm. The guessing algorithm is impractical when the number of guesses increases. Because the number of possibilities increases exponentially with increasing the number of guesses. A new …

    concordia Download PDF for Use of the LDPC codes Over the Binary Erasure Multiple Access Channel (opens in a new tab)