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 21 for “"Graph computation"”.

  1. Iterative Graph Computation In The Big Data Era

    Iterative graph computation is a key component in many real-world applications, as the graph data model naturally captures complex relationships between entities. The big data era has seen the rise of several new challenges to this classic computation model. In this dissertation we describe three …

    cornell Repository record for Iterative Graph Computation In The Big Data Era (opens in a new tab)

  2. Accelerating graph computation with system optimizations and algorithmic design

    … data in today's world can be represented in a graph form, and these graphs can then be used as input to graph applications to derive useful information, such as shortest paths in a road network, similarity between drugs in a drug-protein network, persons of interest in a social network, or …

    texas Repository record for Accelerating graph computation with system optimizations and algorithmic design (opens in a new tab)

  3. A bitwise clique detection approach for accelerating power graph computation and clustering dense graphs

    Graphs are at the essence of many data representations. The visual analytics over graphs is usually difficult due to their size, which makes their visual display challenging, and their fundamental algorithms, which are often classified as NP-hard problems. The Power Graph Analysis (PGA) is a method …

    brazil-ufrgs Repository record for A bitwise clique detection approach for accelerating power graph computation and clustering dense graphs (opens in a new tab)

  4. 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)

  5. Enhancing Parallelization of Agent-based Graph Computing

    … processing but are not always well suited for graph computation. The MASS (Multi-Agent Spatial Simulation) Java library instead provides an agent-based approach to distributed graph computation and has been proven effective for graph computing applications and graph database. However, the …

    washington Repository record for Enhancing Parallelization of Agent-based Graph Computing (opens in a new tab)

  6. Post Disaster Path Planning and Visualization

    … visualization that emphasizes usability, rapid computation, and integration of geospatially anchored road damage information. Unlike prior approaches that require extensive information and large computational requirements, this method focuses on operating with lightweight damage annotations and …

    tamu Repository record for Post Disaster Path Planning and Visualization (opens in a new tab) Embargoed until 2027-12-01

  7. Post Disaster Path Planning and Visualization

    … visualization that emphasizes usability, rapid computation, and integration of geospatially anchored road damage information. Unlike prior approaches that require extensive information and large computational requirements, this method focuses on operating with lightweight damage annotations and …

    tamu Repository record for Post Disaster Path Planning and Visualization (opens in a new tab) Embargoed until 2027-12-01

  8. Post Disaster Path Planning and Visualization

    … visualization that emphasizes usability, rapid computation, and integration of geospatially anchored road damage information. Unlike prior approaches that require extensive information and large computational requirements, this method focuses on operating with lightweight damage annotations and …

    tamu Repository record for Post Disaster Path Planning and Visualization (opens in a new tab) Embargoed until 2027-12-01

  9. Post Disaster Path Planning and Visualization

    … visualization that emphasizes usability, rapid computation, and integration of geospatially anchored road damage information. Unlike prior approaches that require extensive information and large computational requirements, this method focuses on operating with lightweight damage annotations and …

    tamu Repository record for Post Disaster Path Planning and Visualization (opens in a new tab) Embargoed until 2027-12-01

  10. Performance study of an implementation of the push-relabel maximum flow algorithm in Apache Spark's GraphX, A

    GraphX is an API for graph computation built upon Apache Spark, a fast and generalized engine for large-scale data processing in the cloud. While the popularity of Spark and GraphX is growing, the relatively young technology has yet to explore the breadth of graph problems that exist in the field. …

    colo-mines Repository record for Performance study of an implementation of the push-relabel maximum flow algorithm in Apache Spark's GraphX, A (opens in a new tab)

  11. Information And Social System Interaction

    … procrastination, visibility and geographic differences. We have confirmed the predictive power of early readership through regression and discussed undesirable effects of recommendation and possibilities of new impact metrics. In the second part we demonstrate extraction of …

    cornell Repository record for Information And Social System Interaction (opens in a new tab)

  12. Scalable big data systems: Architectures and optimizations

    … contributions. First, it introduces a suite of graph partitioning algorithms that can run much faster than existing data distribution methods and inherently scale to the growth of big data. The main idea of these approaches is to partition a big graph by preserving the core computational data …

    gatech Repository record for Scalable big data systems: Architectures and optimizations (opens in a new tab)

  13. Resource-constrained, scalable learning

    … bottlenecks in the context of distributed computation. These computational constraints spell out a demand for efficient tools that guarantee a solution in the face of limited resources, even when the data is very noisy or highly incomplete. For the first part of this dissertation, we …

    texas Repository record for Resource-constrained, scalable learning (opens in a new tab)

  14. Effficient Graph-based Computation and Analytics

    … of data, which include 1) how to perform dynamic graph analytics in a parallel and robust manner within a reasonable time? 2) How to conduct performance optimizations on a property graph representing and consisting of the semantics of code, data, and runtime systems for big data applications? 3) …

    ucf Repository record for Effficient Graph-based Computation and Analytics (opens in a new tab)

  15. Innovative mining, processing, and application of big graphs

    … advances in science and technology, big graph (or network) data, such as World Wide Web, social networks, academic collaboration networks, transportation networks, telecommunication networks, biological networks, and electrical networks, have grown at an astonishing rate in terms of …

    gatech Repository record for Innovative mining, processing, and application of big graphs (opens in a new tab)

  16. Εξατομίκευση επερωτήσεων σύμφωνα με τις προτιμήσεις του χρήστη

    … a structured user profile is formulated as a graph computation problem. Efficient algorithms that derive the top K preferences from a user profile that are related to a query are described. The top K preferences derived from the user profile may be integrated into the initial query so that the …

    greece Repository record for Εξατομίκευση επερωτήσεων σύμφωνα με τις προτιμήσεις του χρήστη (opens in a new tab)

  17. Data-Driven Intelligent Scheduling For Long Running Workloads In Large-Scale Datacenters

    … datacenters are evolving to host heterogeneous computation workloads including online web services, batch processing, machine learning, streaming computing, interactive query and graph computation on shared clusters. Most of them are long-running workloads that leverage long-lived containers to …

    wayne-thes Repository record for Data-Driven Intelligent Scheduling For Long Running Workloads In Large-Scale Datacenters (opens in a new tab)

  18. Optimizing Differential Computation for Large-Scale Graph Processing

    … by entities and their relationships. Graphs naturally emerge as the most intuitive abstraction for modeling these datasets. Many practical applications seek the ability to share computations across multiple snapshots of evolving graphs to efficiently perform analyses, such as …

    waterloo Repository record for Optimizing Differential Computation for Large-Scale Graph Processing (opens in a new tab)

  19. Enabling efficient graph computing with near-data processing techniques

    With the emergence of data science, graph computing is becoming a crucial tool for processing big connected data. However, when mapped to modern computing systems, graph computing typically suffers from poor performance because of inefficiencies in memory subsystems. At the same time, emerging …

    gatech Repository record for Enabling efficient graph computing with near-data processing techniques (opens in a new tab)

  20. Triangle counting and listing in directed and undirected graphs using single machines

    Triangle enumeration is an important element in graph analysis, and because of this it is a topic that has been studied extensively. Although the formulation is simple, for large networks the computation becomes challenging as we have to deal with memory limitation and efficiency. Many algorithms …

    uvic Repository record for Triangle counting and listing in directed and undirected graphs using single machines (opens in a new tab)

Page 1 of 2