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 257 for “"graph models"”.

  1. Abstractions of Graph Models

    Building models, whether to explain or to predict observed data, is an exercise of describing how the values of observed variables depend on those of others. Black box models only describe relationships between observed variables, and they are evaluated by their ability to accurately describe the …

    byu Repository record for Abstractions of Graph Models (opens in a new tab) Download PDF for Abstractions of Graph Models (opens in a new tab)

  2. Maximum likelihood estimation in Gaussian AMP chain graph models and Gaussian ancestral graph models

    Graphical Markov models use graphs to represent dependencies between stochastic variables. Via Markov properties, missing edges in the graph are translated into conditional independence statements, which, in conjunction with a distributional assumption, define a statistical model. This thesis …

    washington Repository record for Maximum likelihood estimation in Gaussian AMP chain graph models and Gaussian ancestral graph models (opens in a new tab)

  3. Graph models and system diagnosis.

    The connectivity of a system is an important measure of fault tolerance. Typical interconnection networks are sparse and symmetrical. The classical diagnosis theories, such as t-diagnosability, are not appropriate for these systems because the number of faulty elements is limited by the minimum …

    oklahoma-thes Repository record for Graph models and system diagnosis. (opens in a new tab)

  4. Clique graph models for independent computations

    … interrelationships clearly is the clique graph. Clique graphs are used in the development of divide-and-conquer algorithms, sparse matrix factorization schemes, and information propagation in knowledge-based systems, among other important applications.</p> <p>This dissertation develops new …

    utk-theses Repository record for Clique graph models for independent computations (opens in a new tab)

  5. Hierarchical Graph Models for Conflict Resolution

    The hierarchical graph model is developed for representing strategic conflicts having a hierarchical structure. More specifically, in a hierarchical graph model, one or more decision makers (DMs) at a higher level are involved in lower level or local disputes, such as when a central government is …

    waterloo Repository record for Hierarchical Graph Models for Conflict Resolution (opens in a new tab)

  6. Random graph models and their applications

    This thesis explores different models of random graphs. The first part treats a change from the preferential attachment model where the network incorporates new vertices and attach them preferentially to the previous vertices with a large number of connections. We introduce on top of this model the …

    lund Repository record for Random graph models and their applications (opens in a new tab) Download PDF for Random graph models and their applications (opens in a new tab)

  7. Random dynamic graph models in neuroscience

    … two different types of stochastic processes on graphs, which<br>can be interpreted as descriptions for phenomena in neuroscience.<br>In the first part mean field limits for non-linear Hawkes processes on a q-Erdős-<br>Rényi-graph are derived. From the neuroscience perspective it is important …

    freiburg-diss Repository record for Random dynamic graph models in neuroscience (opens in a new tab)

  8. Penalized Bayesian exponential random graph models.

    … of diseases and information. Exponential random graph models (ERGM) are one of the popular statistical methods for analyzing network data. ERGM, however, struggle with computational challenges and degeneracy issues, further exacerbated by their inability to handle high-dimensional network data. …

    louisville Repository record for Penalized Bayesian exponential random graph models. (opens in a new tab)

  9. Coloured graph models: Associating emitters and ships

    <p>This thesis examines graph-theoretic approaches to problems arising in emitter- to-platform association, for example in associating emitters and ships. The first part of this thesis focuses on emitters that are observed by two different sensors, which can only determine the bearing the observed …

    oxford Repository record for Coloured graph models: Associating emitters and ships (opens in a new tab)

  10. Graph Models and Shape Deformation for Image Segmentation

    The second part of this thesis is focused on using prior geometric information to improve the reliability and accuracy of image segmentation. Specifically, a new shape-deformation method is proposed to incorporate prior template shape information into image segmentation by deforming a given …

    uiuc Repository record for Graph Models and Shape Deformation for Image Segmentation (opens in a new tab)

  11. Spectral dimension in graph models of causal quantum gravity

    … limit of CDT. In this thesis we introduce graph ensembles as toy models of CDT and show that both the continuum limit and a scale dependent spectral dimension can be defined rigorously. First we focus on a simple graph ensemble, the random comb. It does not have any dynamics from the …

    oxford Repository record for Spectral dimension in graph models of causal quantum gravity (opens in a new tab)

  12. Inferring network structures using hierarchical exponential random graph models

    … have more individual differences. Statistical models for ensembles of networks should describe not only the dependency structure within each network, but also the variations of the structural patterns across networks. Exponential random graph models (ERGMs) provide a highly flexible way to …

    kent Download PDF for Inferring network structures using hierarchical exponential random graph models (opens in a new tab)

  13. On the motion and action prediction using deep graph models

    … in modeling these interactions. Yet, these deep models were using classical deep learning techniques, such as recurrent and convolutional architectures. These approaches are not representative of the spatial and temporal aspects of the observations. This dissertation presents novel approaches …

    texas Repository record for On the motion and action prediction using deep graph models (opens in a new tab)

  14. SYSTEMS ENGINEERING DESIGN AND TRADEOFF ANALYSIS WITH RDF GRAPH MODELS

    … and trade-off analysis. The software pipeline models and visualizes RDF graphs, implements inference rules for the step-by-step selection of design component combinations that satisfy system requirements, identifies non-inferior Pareto-Optimal design solutions, and tracks the size of the RDF …

    maryland Repository record for SYSTEMS ENGINEERING DESIGN AND TRADEOFF ANALYSIS WITH RDF GRAPH MODELS (opens in a new tab)

  15. Bridging the Gap between Sparse Matrix Computation and Graph Models

    … Computing applications including graph neural networks, network analytics, and scientific computing. In sparse matrices, the majority of values are zeros. Traditional methods of storing and processing dense data are unsuitable for the new nature of sparse data, as they end up …

    oklahoma-thes Repository record for Bridging the Gap between Sparse Matrix Computation and Graph Models (opens in a new tab)

Page 1 of 13