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 12814 for “"Trees"”.

  1. Trees

    … concept of my work is to portray the images of trees close to the viewer's eye to instill a sense of nature's grandness.

    vcu Repository record for Trees (opens in a new tab)

  2. Generation of rooted trees and free trees

    … algorithms for generating unlabeled rooted trees and unlabeled free trees . We first simplify Beyer-Hedetniemi's [5] iter­ative algorithm for generating rooted trees by using the more natural parent array representation. We then develop a new recursive algorithm which is much simpler, more …

    uvic Repository record for Generation of rooted trees and free trees (opens in a new tab)

  3. Cross Trees: Visualizing Estimations using Decision Trees

    … based on their position in landscape. CrossTrees are built by grouping data based on their similarities and generating contrast sets between these groups, which help experts to gain insight from knowledge. This thesis tests CrossTrees with two models which simulate software projects: POM3 …

    wvu Repository record for Cross Trees: Visualizing Estimations using Decision Trees (opens in a new tab)

  4. Touching Trees

    Touching Trees is a non-linear “novel” in homage to Richard Brautigan’s Trout Fishing in America. The forty-seven chapters of this work echo the forty-seven chapters in Brautigan’s “novel.” Like the original, it draws on surrealism, whimsy, and is set in the natural world. While there is no story …

    washington Repository record for Touching Trees (opens in a new tab)

  5. Roadside Trees

    Master of Science (M.S.)

    ucf Repository record for Roadside Trees (opens in a new tab)

  6. Opposite Trees

    … graphs, we give the conditions spanning trees of these graphs must satisfy in order to have an opposite tree.

    wilfrid-laurier Repository record for Opposite Trees (opens in a new tab) Download PDF for Opposite Trees (opens in a new tab)

  7. Two Trees

    The Two Trees is a fifteen-minute musical composition for orchestra. Inspired by William Butler Yeats' poem of the same name, the piece depicts the images described by Yeats' poetic narrative through a double theme and variations form consisting of two contrasting themes that are related, one …

    oregon Repository record for Two Trees (opens in a new tab)

  8. On K-trees and Special Classes of K-trees

    The class of k-trees is defined recursively as follows: the smallest k-tree is the k-clique. If G is a graph obtained by attaching a vertex v to a k-clique in a k-tree, then G is also a k-tree. Trees, connected acyclic graphs, are k-trees for k = 1. We introduce a new parameter known as the shell …

    mississippi Repository record for On K-trees and Special Classes of K-trees (opens in a new tab)

  9. On some problems on k-trees and partial k-trees

    … some structural and algorithmic properties of k-trees and partial k-trees. A k-tree can be constructed from a k-complete graph by recursively adding a new vertex which is adjacent to all vertices of an existing k-complete subgraph. Partial k-trees are graphs embeddable in a k-tree with the same …

    ubc Repository record for On some problems on k-trees and partial k-trees (opens in a new tab) Download PDF for On some problems on k-trees and partial k-trees (opens in a new tab)

  10. Combinatorially Thin Trees and Spectrally Thin Trees in Structured Graphs

    … graph is known as graph sparsification. Spanning trees are an important family of graph sparsifiers that maintain connectivity of graphs, and have been utilized in many applications. However, spanning trees are a wide family, and for some applications one might need the spanning tree to have …

    waterloo Repository record for Combinatorially Thin Trees and Spectrally Thin Trees in Structured Graphs (opens in a new tab)

  11. From Gene Trees to Species Trees: Algorithms for Parsimonious Reconciliation

    … a species tree from a collection of gene trees, when gene tree incongruence is assumed to be due to incomplete lineage sorting (ILS), is minimize deep coalescence , or MDC. Exact algorithms for inferring the species tree from rooted, binary trees under MDC were recently introduced. …

    rice Repository record for From Gene Trees to Species Trees: Algorithms for Parsimonious Reconciliation (opens in a new tab)

  12. Labeled Trees and Spanning Trees: Computational Discrete Mathematics and Applications

    … exactly from 1 to n choose 2. Only five Leech trees are known and some non-existence results have been presented through the years. Variations of Leech trees such as the minimal distinct distance trees and modular Leech trees have been considered in recent years. In this thesis, such Leech-type …

    gsu Repository record for Labeled Trees and Spanning Trees: Computational Discrete Mathematics and Applications (opens in a new tab)

  13. Generation of Directed Trees, 2-Trees and Paths Without Duplication

    Made available in DSpace on 2014-12-08T22:23:43Z (GMT). No. of bitstreams: 1 6507149.pdf: 1357558 bytes, checksum: a5fe3032cd0e76c698fe719dac9667cb (MD5) Previous issue date: 1965

    uiuc Repository record for Generation of Directed Trees, 2-Trees and Paths Without Duplication (opens in a new tab)

  14. Leaves on trees

    Leaves on Trees is a 16-minute narrative film about a young boy who gets prescription glasses for the first time. The following report recounts the process of conception, pre-production, production, and post-production undertaken to produce the film. It discusses the hardships and successes of the …

    texas Repository record for Leaves on trees (opens in a new tab)

  15. Recursive hash trees

    <p>As long as there have been computers, there has also been data sets to store in those computers. Data storage and retrieval is an important responsibility of computer scientists. Sometimes a specific framework must be constructed around the unique requirements of a particular application. There …

    ut-knoxville Repository record for Recursive hash trees (opens in a new tab)

  16. Enumerating spanning trees

    … and widely used theorem that there are n° - 2 trees on n labeled vertices [6, p. 70]. Since he originally stated it, the theorem has received much attention: people have proved it in many different ways. In this paper we consider three of these proofs. The first is an algebraic . result using …

    ut-knoxville Repository record for Enumerating spanning trees (opens in a new tab)

  17. Improving Hoeffding Trees

    … a state-of-the-art method for inducing decision trees from data streams. The aim of this thesis is to improve this algorithm. To measure improvement, a comprehensive framework for evaluating the performance of data stream algorithms is developed. Within the framework memory size is fixed in order …

    waikato-masters Repository record for Improving Hoeffding Trees (opens in a new tab) Download file for Improving Hoeffding Trees (opens in a new tab)

  18. Generating spanning trees

    Algorithms for generating all spanning trees of a graph are presented. A series of improvements to the basic contraction-deletion algorithm results in the development of an algorithm which generates spanning trees in a Gray code order in constant amortized time. The improvements consist of removing …

    uvic Repository record for Generating spanning trees (opens in a new tab)

  19. Dyadic decision trees

    … new family of classifiers called dyadic decision trees (DDTs) and develops their theoretical properties within the framework of statistical learning theory. First, we show that DDTs achieve optimal rates of convergence for a broad range of classification problems and are adaptive in three …

    rice Repository record for Dyadic decision trees (opens in a new tab)

  20. Hearts and Trees

    … books, and two-dimensional images. Maps and trees are the common motifs and metaphors found in my work. I paint on the surface of maps to reference significant locations in my journey of personal growth. I incorporate found sticks and branches in my sculptures and paint images of trees to …

    vcu Repository record for Hearts and Trees (opens in a new tab)

Page 1 of 641