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 83 for “"Graph model"”.

  1. Constant time algorithms in sparse graph model

    We focus on constant-time algorithms for graph problems in bounded degree model. We introduce several techniques to design constant-time approximation algorithms for problems such as Vertex Cover, Maximum Matching, Maximum Weighted Matching, Maximum Independent Set and Set Cover. Some of our …

    mit Repository record for Constant time algorithms in sparse graph model (opens in a new tab)

  2. A comprehensive study of multiplicative attribute graph model

    Graphs are powerful tools to describe social, technological and biological networks, with nodes representing agents (people, websites, gene, etc.) and edges (or links) representing relations (or interactions) between agents. Examples of real-world networks include social networks, the World Wide …

    maryland Repository record for A comprehensive study of multiplicative attribute graph model (opens in a new tab)

  3. Bond graph model based control of robotic manipulators

    … may be made by incorporating a mathematical model of the manipulator in the control algorithm. Control schemes such as `computed torque' incorporate an inverse model of the manipulator to calculate the input torques required to force the end-effector to follow a desired trajectory. The …

    glasgow Repository record for Bond graph model based control of robotic manipulators (opens in a new tab)

  4. The Lexicon Graph Model : a generic model for multimodal lexicon development

    Das Lexicon Graph Model stellt ein Modell für Lexika dar, die korpusbasiert sein können und multimodale Informationen enthalten. Hierbei wird die Perspektive der Lexikontheorie eingenommen, wobei die zugrundeliegenden Datenstrukturen sowohl vom Lexikon als auch von Annotationen betrachtet werden. …

    bielefeld Repository record for The Lexicon Graph Model : a generic model for multimodal lexicon development (opens in a new tab)

  5. Bond graph model and computer simulation of a hydrostatic drive test stand

    … to compare torque transducers. A mathematical model of the device was derived using the bond graph approach and was implemented using the Advanced Continuous Simulation Language (ACSL). The test stand was used to obtain experimental data to try to refine the model parameters. To facilitate the …

    vt Repository record for Bond graph model and computer simulation of a hydrostatic drive test stand (opens in a new tab)

  6. An Object Oriented Simulator for Conceptual Graphs

    … of an object-oriented simulator for conceptual graphs. Conceptual graphs are a means of representing information and knowledge. In particular, they may be used to represent the behavior of mechanisms. Conceptual graph simulation provides the means for verifying that the conceptual graph model of …

    vt Repository record for An Object Oriented Simulator for Conceptual Graphs (opens in a new tab)

  7. Bounds on contention management in radio networks

    … problem in two well-studied wireless network models. The local broadcast problem is a theoretical approach for capturing the contention management issue in wireless networks; it assumes that processes are provided messages, one by one, that must be delivered to their neighbors. We study this …

    mit Repository record for Bounds on contention management in radio networks (opens in a new tab)

  8. Inferring beliefs for search and rescue from natural language

    … communicate instructions to a robot. A number of models, including probabilistic grounding graphs, have been used to ground natural language input to the real-world tasks a robot must perform. In this thesis, I provide two extensions to existing work in grounding natural language instructions. …

    mit Repository record for Inferring beliefs for search and rescue from natural language (opens in a new tab)

  9. Design and implementation of a synchronization scheduler in a distributed multimedia presentation system

    … system. First, we develop an interval constraint graph model to describe the temporal relationships among media objects. Second, based on the model, we give a way to produce an optimal schedule from a set of constraints using a linear programming solver. Third, we develop a run time rescheduling …

    concordia Repository record for Design and implementation of a synchronization scheduler in a distributed multimedia presentation system (opens in a new tab)

  10. Topics In Probabilistic Combinatorics

    … basic definitions, lemmas, and theorems from graph theory, asymptotic analysis, and probability which will be used throughout the paper. Chapter 2 introduces the independent domination number. It is then shown that in the random graph model G(n,p) with probability tending to one, the …

    siu-theses Repository record for Topics In Probabilistic Combinatorics (opens in a new tab)

  11. Timing Analysis of Embedded Real -Time Systems

    … structured into its tasks, and the structure is modeled using a task graph. Our solution uses the timing behavior committed by the environment to the system first to derive the timing constraints on the system's internal behavior and then use them to derive and validate the timing constraints on …

    uiuc Repository record for Timing Analysis of Embedded Real -Time Systems (opens in a new tab)

  12. Crossings in Clustered Level Graphs

    Clustered graphs are an enhanced graph model with a recursive clustering of the vertices according to a given nesting relation. This prime technique for expressing coherence of certain parts of the graph is used in many applications, such as biochemical pathways and UML class diagrams. For directed …

    passau-thes Repository record for Crossings in Clustered Level Graphs (opens in a new tab)

  13. Hypergraph-Based Combinatorial Optimization of Matrix-Vector Multiplication

    … multiplication, and both are solved using hypergraph models. For both of these problems, the cost of the combinatorial optimization process can be effectively amortized over many matrix-vector products. The first problem we address is optimization of serial matrix-vector multiplication for …

    uiuc Repository record for Hypergraph-Based Combinatorial Optimization of Matrix-Vector Multiplication (opens in a new tab)

  14. Estudo de alguns problemas de transporte em redes com fluxo dinâmico

    … are defined as transportation problems in graphs with dynamic flow. The dynamic flow graph model presented in this work represents networks such that each branch admits as incoming flow and an outgoing flow, these flows not being necessarily equal. A differencial equation relates the …

    brazil-uerj Repository record for Estudo de alguns problemas de transporte em redes com fluxo dinâmico (opens in a new tab)

  15. Leaders, followers, and community detection

    Communities in social interaction networks or graphs are sets of well-connected, and very often overlapping vertices. Formally, we view any maximal clique of the social network graph as a community. The problem of finding maximal cliques is known to be computationally hard. The goal of this work is …

    mit Repository record for Leaders, followers, and community detection (opens in a new tab)

  16. Analytic search methods in online social networks

    … in Iraq and Syria (ISIS) to develop a behavioral models for these extremist users. These models are used to identify new extremist accounts, identify pairs of accounts belonging to the same user, and predict to whom a user will connect when opening an account. We use this final model to inform our …

    mit Repository record for Analytic search methods in online social networks (opens in a new tab)

  17. Applying Graph Theory to Conservation Documentation

    … This thesis leverages mathematical graph theory to identify and examine networks captured in conservation documentation. It demonstrates how the use of existing graph-based technologies, such as semantic web technologies (RDF) and property graph (PG) databases, can be used to build …

    arts-london Repository record for Applying Graph Theory to Conservation Documentation (opens in a new tab)

  18. Mogway: um arcabouço para bancos de dados múltiplos grafos

    Graphs are a powerful representation technique, capable of capturing the relationship between entities. They are useful to understand a wide variety of data sets from many areas like science, government and business. In the last years has resurged the interest in storing and managing graph data due …

    brazil-uerj Repository record for Mogway: um arcabouço para bancos de dados múltiplos grafos (opens in a new tab)

  19. Community detection in preferential attachment graphs

    … problem of community detection in a new random graph model, which is a generalization of preferential attachment graphs. This model has some features that are more realistic than those of the often-studied stochastic block model (SBM). A message passing algorithm for community detection is …

    uiuc Repository record for Community detection in preferential attachment graphs (opens in a new tab)

  20. Analysis of CRAY-1S Using Dataflow Graphs.

    … of computer systems based on a dataflow graph model is presented. The approach consists of representing the components of a computer system as the nodes of a dataflow graph and the interconnections between the components as the arcs of the dataflow graph. The elapsed time and the …

    uab Repository record for Analysis of CRAY-1S Using Dataflow Graphs. (opens in a new tab)

Page 1 of 5