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 42 for “"tree graph"”.

  1. Modern Methods for Tree Graph Structures Rendering

    Tento projekt se věnuje problematice zobrazení velkých hierarchických struktur, zejména možnostem vizualizace stromových grafů. Cílem je implementace hyperbolického prohlížeče ve webovém prostředí, který využívá potenciálu neeukleidovské geometrie k promítnutí stromu na hyperbolickou rovinu. Velký …

    brno-tech Repository record for Modern Methods for Tree Graph Structures Rendering (opens in a new tab)

  2. Modified tree graph algorithm for ultimate pit limit analysis

    Includes bibliographical references.

    colo-mines Repository record for Modified tree graph algorithm for ultimate pit limit analysis (opens in a new tab)

  3. The Existence and Generation of a Hamilton Circuit in a Tree Graph

    Made available in DSpace on 2014-12-08T22:24:05Z (GMT). No. of bitstreams: 1 6706642.pdf: 1276319 bytes, checksum: e37b344a8f9743efa53d201a0adecaa6 (MD5) Previous issue date: 1966

    uiuc Repository record for The Existence and Generation of a Hamilton Circuit in a Tree Graph (opens in a new tab)

  4. On the Discrete Number of Tree Graphs

    … Given a set of points in Euclidean space and a tree graph consisting of a much smaller number of vertices, we study the maximum possible number of tree graphs which can be represented by a prescribed tree graph. We derive an algorithm for finding tight bounds for this family of problems up to …

    vt Repository record for On the Discrete Number of Tree Graphs (opens in a new tab)

  5. Graphic representation of knowledge structures in ESL student learning

    … if the structure of that information is given in graphic as well as verbal form, and that this is especially true for second language students. These suggestions have major implications for the education of second language learners. This study was conducted to explore the role and value of graphic …

    ubc Repository record for Graphic representation of knowledge structures in ESL student learning (opens in a new tab) Download PDF for Graphic representation of knowledge structures in ESL student learning (opens in a new tab)

  6. Tree Graphs and Orthogonal Spanning Tree Decompositions

    Given a graph G, we construct T(G), called the tree graph of G. The vertices of T(G) are the spanning trees of G, with edges between vertices when their respective spanning trees differ only by a single edge. In this paper we detail many new results concerning tree graphs, involving topics such as …

    portland-state Repository record for Tree Graphs and Orthogonal Spanning Tree Decompositions (opens in a new tab)

  7. Reconstructing Cell Lineage Trees from Phenotypic Features with Metric Learning

    … studying developmental processes is to infer the tree graph of cell lineage division and differentiation histories, providing an analytical framework for dissecting individual cells’ molecular decisions during replication and differentiation. Although genetically engineered lineage-tracing methods …

    penn Repository record for Reconstructing Cell Lineage Trees from Phenotypic Features with Metric Learning (opens in a new tab)

  8. Logistic Regression and Cox Hazard Modeling with Sparse High Dimensional Data via Elastic Net Regularization and Graph-Guided Aggregation

    … between features that can be organized as a tree graph. While their work is restricted to standard Gaussian regression, we aim to attack the rare feature aggregation problem for the Generalized Linear Model (GLM) setting. Additionally, we explore the use of a more general graph structure by …

    unh-thes Repository record for Logistic Regression and Cox Hazard Modeling with Sparse High Dimensional Data via Elastic Net Regularization and Graph-Guided Aggregation (opens in a new tab)

  9. Large-scale Tree Parsimony

    <p>Finding the tree of life is one of the major challenges that scientists are attempting to solve. It is widely believed that the evolution of species can (mostly) be depicted in a tree graph, the phylogenetic tree. However, the true phylogenetic species tree is often unknown. One approach is to …

    iastate Repository record for Large-scale Tree Parsimony (opens in a new tab)

  10. Data-driven metallurgical design for high strength low alloy (HSLA) steel

    … and elongation of steel. In addition, the tree-graph representation of the results provides a powerful multi-dimensional screening tool for searching interesting regions in the composition-processing space, which can be used as a guideline for metallurgical design and further experimental …

    iastate Repository record for Data-driven metallurgical design for high strength low alloy (HSLA) steel (opens in a new tab)

  11. Capacitated, unbalanced p-median problems on a chain graph with a continuum of link demands

    … of locating p capacitated facilities on a chain graph, and simultaneously determining the allocation of their supplies in order to satisfy a continuum of demand which is characterized by some weighted probability density function defined on the chain graph. The objective is to minimize the total …

    vt Repository record for Capacitated, unbalanced p-median problems on a chain graph with a continuum of link demands (opens in a new tab)

  12. Topics in Estimation and Inference with Multivariate Missing Data

    … mechanisms, extending the work in Chapter 3. A tree graph is a directed acyclic graph on the missing patterns, and each one represents a MNAR mechanism. Combining this with the idea of a conjugate odds property, we are able to preserve distributional structure across missing patterns and …

    washington Repository record for Topics in Estimation and Inference with Multivariate Missing Data (opens in a new tab)

  13. Root2Graph: A Graph-based Semantic Segmentation Architecture For Plant Roots

    … structures. A plant root system is essentially a tree/graph-like structure with branching points as nodes and the root segments as edges. Leveraging this graph-like structure of plant roots, this thesis proposes a graph-based semantic segmentation approach using graph neural networks (GNN), which …

    sask Repository record for Root2Graph: A Graph-based Semantic Segmentation Architecture For Plant Roots (opens in a new tab)

  14. Investigation of Solution Space of Trees and DAGs for Realization of Combinational Logic in AT 6000 series FPGAs

    Various tree and Directed Acyclic Graph structures have been used for representation and manipulation of switching functions. Among these structures the Binary Decision Diagrams have been the most widely used in logic synthesis. A BDD is a binary tree graph that represents the recursive execution …

    portland-state Repository record for Investigation of Solution Space of Trees and DAGs for Realization of Combinational Logic in AT 6000 series FPGAs (opens in a new tab)

  15. Purchasing power parity methods of making international comparisons

    … the taxonomy reinterprets PPP methods in a graph theoretic context. This reinterpretation yields many useful insights. The second essay was motivated by the realization that virtually all PPP methods have the same underlying graph theoretic structure. This essay develops a new PPP method …

    ubc Repository record for Purchasing power parity methods of making international comparisons (opens in a new tab) Download PDF for Purchasing power parity methods of making international comparisons (opens in a new tab)

  16. Finding Paths via Quantum Systems and Its Application for Quantum Algorithms

    … path finding via a quantum system. For a given graph G that can be expressed by connections and nodes, the same graph can be mapped onto a quantum system with a Hilbert space H. All of the connections in the graph can be represented as states in H, and the nodes act as sites for local unitary …

    cuny-grad Repository record for Finding Paths via Quantum Systems and Its Application for Quantum Algorithms (opens in a new tab)

  17. Succinct Representation of Trees and Graphs

    … thesis, we study succinct representations of trees and graphs. A succinct representation of a combinatorial object is a space efficient representation that supports a reasonable set of operations and queries on the object in constant or near constant time on the RAM with logarithmic word size. …

    waterloo Repository record for Succinct Representation of Trees and Graphs (opens in a new tab)

  18. Pedestrian crash prediction and analyzing contributing factors across Texas : an interpretable machine learning approach

    This study applied tree-based machine learning methods to investigate the contributing factors to both crash frequency and injury severity in vehicle-pedestrian crash events. Vehicle and roadway characteristics, driver and pedestrian attributes, traffic controls and land use conditions, transit …

    texas Repository record for Pedestrian crash prediction and analyzing contributing factors across Texas : an interpretable machine learning approach (opens in a new tab)

  19. An Intelligent Email Response System (IERS)

    … both RF and CNN models. Moreover, using parser tree graph embedding with Feather and GL2VEC fails to detect questions. Finally, using TF-IDF weighted GloVe embedding gives worse results compare to GloVe embedding for both RF and CNN models. In response generation, we use the SOTA BART model on …

    queens Repository record for An Intelligent Email Response System (IERS) (opens in a new tab)

  20. Optimal Design of Reconfigurable Products Considering Product Configurations and Reconfiguration Processes

    … processes.First, a generic design AND-OR tree is used to model design candidates and design parameters based on the same requirements, and generic process AND-OR graphs are employed to model reconfiguration process candidates and process parameters. Specific design and reconfiguration …

    calgary Repository record for Optimal Design of Reconfigurable Products Considering Product Configurations and Reconfiguration Processes (opens in a new tab)

Page 1 of 3