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 11 of 11 for “"Graph based Applications"”.

  1. Exploring Multi-Level Parallelism For Graph-Based Applications Via Algorithm And System Co-Design

    Graph processing is at the heart of many modern applications where graphs are used as the basic data structure to represent the entities of interest and the relationships between them. Improving the performance of graph-based applications, especially using parallelism techniques, has drawn …

    wm-mary Repository record for Exploring Multi-Level Parallelism For Graph-Based Applications Via Algorithm And System Co-Design (opens in a new tab)

  2. Domain-Specific Optimization For Machine Learning System

    … used but brings limited benefits because ML applications vary in execution behaviors based on their algorithms, input data, and configurations. It's difficult to perform comprehensive ML system optimizations without application specific information. Therefore, domain-specific optimization, a …

    wm-mary Repository record for Domain-Specific Optimization For Machine Learning System (opens in a new tab)

  3. Improved and domain specific model soups

    … to enhance the performance and efficiency of Graph Neural Networks (GNNs). Traditional ensemble methods, while accurate, incur significant computational and memory costs, limiting scalability. We propose two novel souping algorithms: Learned Souping (LS), which employs gradient descent to …

    iastate Repository record for Improved and domain specific model soups (opens in a new tab)

  4. Characterization of Sparsity-aware Optimization Paths for Graph Traversal on FPGA

    … (BFS) is a fundamental building block in many graph-based applications, but it is difficult to optimize for a field-programmable gate array (FPGA) due to its irregular memory-access patterns. Prior work, based on hardware description languages (HDLs) and high-level synthesis (HLS), address the …

    vt Repository record for Characterization of Sparsity-aware Optimization Paths for Graph Traversal on FPGA (opens in a new tab)

  5. Advanced semantics for accelerated graph processing

    Large-scale graph applications are of great national, commercial, and societal importance, with direct use in fields such as counter-intelligence, proteomics, and data mining. Unfortunately, graph-based problems exhibit certain basic characteristics that make them a poor match for conventional …

    lsu-thes Repository record for Advanced semantics for accelerated graph processing (opens in a new tab)

  6. Towards Trustworthy Deep Graph Learning

    Deep graph learning (DGL) has emerged as powerful tools for modeling complex graph-structured data across fields such as bioinformatics, finance, and social network analysis. However, despite their success, DGL faces critical challenges related to trustworthiness--a quality encompassing robustness …

    tamu Repository record for Towards Trustworthy Deep Graph Learning (opens in a new tab)

  7. Towards interactive betweenness centrality estimation for transportation network using capsule network

    The node importance of a graph needs to be estimated for many graph-based applications. One of the most popular metrics for measuring node importance is betweenness centrality, which measures the amount of influence a node has over the flow of information in a graph. However, the computation …

    colostate Repository record for Towards interactive betweenness centrality estimation for transportation network using capsule network (opens in a new tab)

  8. Compiler-assisted workload consolidation to efficiently exploit dynamic parallelism for recursive applications

    … been widely used to parallelize and accelerate applications for its high throughput. Traditionally, a GPU function can only be launched from the CPU side. This results in the fact that GPUs are preferable for those application which express a flat data parallelism, a simple data parallelism that …

    missouri Repository record for Compiler-assisted workload consolidation to efficiently exploit dynamic parallelism for recursive applications (opens in a new tab)

  9. Sparse modeling of high-dimensional data for learning and vision

    … recognized as providing high performance for applications as diverse as noise reduction, compression, inpainting, compressive sensing, pattern classification, and blind source separation. In this dissertation, we learn the sparse representations of high-dimensional signals for various learning …

    uiuc Repository record for Sparse modeling of high-dimensional data for learning and vision (opens in a new tab)

  10. Using Eventual Consistency to Improve the Performance of Distributed Graph Computation In Key-Value Stores

    … of multiple replicas located in different geographical regions to provide higher availability and fault tolerance. Consequently, a protocol is employed to ensure that data are consistent across the replicas.The CAP theorem states the impossibility of simultaneously achieving three desirable …

    msu Repository record for Using Eventual Consistency to Improve the Performance of Distributed Graph Computation In Key-Value Stores (opens in a new tab)

  11. Αλγόριθμοι διαχείρισης δεδομένων και εξαγωγή γνώσης σε εφαρμογές γράφων

    … where data is represented in the form of graphs. Specifically, this thesis presents algorithms applied in Sensor Networks and Social Networks, using theoretical tools from the Graph Theory research area. For applications in sensor networks, this thesis examines problems related to data …

    greece Repository record for Αλγόριθμοι διαχείρισης δεδομένων και εξαγωγή γνώσης σε εφαρμογές γράφων (opens in a new tab)