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 “"graph ordering"”.

  1. Statistical Machine Translation of English Text to API Code Usages: A comparison of Word Map, Contextual Graph Ordering, Phrase-based, and Neural Network Translations

    … which is then ordered using existing code usage graphs. The approach is quite effective, with a precision and recall of 20 and 50, respectively. Adding context to the word map model, ContextualExpansion, is able to increase the precision to 25 with a recall of 40. The traditional phrase-based …

    concordia Download PDF for Statistical Machine Translation of English Text to API Code Usages: A comparison of Word Map, Contextual Graph Ordering, Phrase-based, and Neural Network Translations (opens in a new tab)

  2. The GraphGrind Framework: Fast Graph Analytics on Large Shared-Memory Systems

    … they provide an opportunity to perform efficient graph analytics on a single machine. Graph analytics is characterised by frequent synchronisation, which is addressed in part by shared memory systems. However, performance is limited by load imbalance and poor memory locality, which originate in …

    qu-belfast Repository record for The GraphGrind Framework: Fast Graph Analytics on Large Shared-Memory Systems (opens in a new tab) Download PDF for The GraphGrind Framework: Fast Graph Analytics on Large Shared-Memory Systems (opens in a new tab)

  3. Separability and Vertex Ordering of Graphs

    Many graph optimization problems, such as finding an optimal coloring, or a largest clique, can be solved by a divide-and-conquer approach. One such well-known technique is decomposition by clique separators where a graph is decomposed into special induced subgraphs along their clique separators. …

    wilfrid-laurier Repository record for Separability and Vertex Ordering of Graphs (opens in a new tab) Download PDF for Separability and Vertex Ordering of Graphs (opens in a new tab)

  4. Overcoming Memory Capacity Constraints for Large Graph Applications on GPUs

    Graphics Processing Units (GPUs) have been used successfully for accelerating a wide variety of applications in the domains of scientific computing, machine learning, and data analytics over the last decade. Two important trends that have emerged across these domains are that for a lot of …

    gatech Repository record for Overcoming Memory Capacity Constraints for Large Graph Applications on GPUs (opens in a new tab)

  5. New Sequential and Scalable Parallel Algorithms for Incomplete Factor Preconditioning

    … a sequence of lemmas and theorems that provide graph theoretic characterizations of both definitions; these characterizations are based on the static graph of a matrix, G(A). Our Incomplete Fill Path Theorem characterizes fill levels per the sum definition; this is the definition that is used in …

    odu Repository record for New Sequential and Scalable Parallel Algorithms for Incomplete Factor Preconditioning (opens in a new tab)

  6. Related Orderings of AT-Free Graphs

    An ordering of a graph G is a bijection of V(G) to {1, . . . , |V(G)|}. In this thesis, we consider the complexity of two types of ordering problems. The first type of problem we consider aims at minimizing objective functions related to an ordering of the graph. We consider the problems Cutwidth, …

    waterloo Repository record for Related Orderings of AT-Free Graphs (opens in a new tab)