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 55 for “"Graph traversal"”.
-
Multi-Agent Distributed Graph Traversal
… system and related algorithms that solve the graph traversal problem in a distributed and decentralized manner while optimizing a set of costs. The environment is modelled as a graph where every node is the point for the agents to accomplish some task or to distinguish the point as an obstacle …
-
Augmenting DOLAR Query Language with graph traversal capabilities
… γράφων, που διεκπεραιώνονται μέσω του Object Graph της εφαρμογής, ξεκλειδώνοντας ισχυρές δυνατότητες αναζήτησης γραφημάτων που ήταν ανέφικτες με το ElasticSearch DQL Backend. Τέλος, η διατριβή διερευνά επίσης την εισαγωγή δυνατοτήτων ερωτημάτων πάνω στο Model Graph μέσω της DQL, ανοίγοντας το …
-
Power-constrained performance optimization of GPU graph traversal
Graph traversal represents an important class of graph algorithms that is the nucleus of many large scale graph analytics applications. While improving the performance of such algorithms using GPUs has received attention, understanding and managing performance under power constraints has not yet …
-
Theory of graph traversal edit distance, extensions, and applications
… problems in applied machine learning deal with graphs (also called networks), including social networks, security, web data mining, protein function prediction, and genome informatics. The kernel paradigm beautifully decouples the learning algorithm from the underlying geometric space, which …
-
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 …
-
A hybrid approach for selecting and optimizing graph traversal strategy for analyzing big code
… Source code analysis is often realized as traversals over source code artifacts represented as graphs. Since the number of artifacts that are analyzed is huge, in millions, the efficiency of the source code analysis technique is very important. The performance of source code analysis …
-
An Adaptive Hybrid Method for Link Prediction in Multi-Modal Directed Complex Networks Using the Graph Traversal Pattern
The paper examines the link prediction problem for directed multi-modal complex networks. Specically, a hybrid method combining collaborative filtering and Triadic Closeness methods is developed. The methods are applied to a sample of the GitHub network. Implementation details are discussed, with a …
-
An Adaptive Hybrid Method for Link Prediction in Multi-Modal Directed Complex Networks Using the Graph Traversal Pattern
The paper examines the link prediction problem for directed multi-modal complex networks. Specically, a hybrid method combining collaborative filtering and Triadic Closeness methods is developed. The methods are applied to a sample of the GitHub network. Implementation details are discussed, with a …
-
Data Science for Mining Patterns in Spatial Events
… shortest paths, a bi-directional fragment-multi- graph traversal is proposed for discovering linear hotspots on all simple paths, and an apriori-graph traversal algorithm is proposed to detecting spatio-temporal intersection patterns. Extensive theoretical and experimental analyses show that the …
-
Graph Processing in Main-Memory Column Stores
… applications leverage the advantages of a graph data model, such as the offered schema flexibility and an explicit representation of relationships between entities. As a consequence, companies are confronted with the challenge of storing, manipulating, and querying terabytes of graph data …
-
Data Race Detection for Event-Driven Parallel Runtime Systems
… programs. In this dissertation, we propose a graph-traversal based data race detection method for EDP runtimes. It introduces a reachability graph (encodes the dependences in a program), to check the happens-before relation between memory accesses. In order to reduce the time complexity for …
-
Two dimensional and three dimensional path planning in robotics
… convex areas are represented as a nodes in a graph, and a graph traversal strategy that dynamically allocates costs to graph path is used. Modification of the algorithm for small computational time and optimality is discussed. The 3D path planning is done in the three orthogonal …
-
Skaidymo poveikis grafų duomenų bazių našumui: maišos ir predikatų skaidymo palyginimas /
This paper theoretically and empirically analyses graph database sharding methods, comparing predicate sharding in Dgraph and hash sharding in ArangoDB. An experimental environment was deployed on Google Cloud Platform using five-node clusters for each database, populated with a synthetic social …
-
Optimizing graph analyses on GPUs
… to accelerate computation onlarge real-world graphs. However, implementing parallel graph algorithms on GPUs is quite challenging because of the following two facts. First, the DRAM on a GPU is limited and the size of some real-world graphs are possibly larger than the global memory on a GPU. …
-
Algorithm design on multicore processors for massive-data analysis
… use network abstraction to construct large-scale graphs. Graph algorithms such as traversal and search are memory-intensive and typically require very little computation, with access patterns that are irregular and fine-grained. The increasing streaming data rates in various domains such as …
-
Interactive graph layout: The exploration of large graphs.
Directed and undirected graphs provide a natural notation for describing many fundamental structures of computer science. Unfortunately graphs are hard to draw in an easy to read fashion. Traditional graph layout algorithms have focused on creating good layouts for the entire graph. This approach …
-
GREMLIN++ & BITGRAPH: IMPLEMENTING THE GREMLIN TRAVERSAL LANGUAGE AND A GPU-ACCELERATED GRAPH COMPUTING FRAMEWORK IN C++
… of two major components, Gremlin++ and BitGraph. Gremlin++ is a C++ implementation of the Gremlin graph traversal language designed for interfacing with C++ graph processing backends. BitGraph is a graph backend written in C++ designed to outperform Java-based competitors, such as …
-
A testing metric for designs modelled as hierarchical finite-state machines.
… modelled as an HFSM. The method is based on graph traversal and uses the hierarchy of the underlying directed graph. A recursive algorithm computes breadth, the number of paths needed just to cover all transitions at least once. This idea is extended to cover all states, all inputs, and all …
-
The shortest path problem in the plane with obstacles: a graph modeling approach to producing finite search lists of homotopy classes
… by modeling the topology of the region with a graph. Optimality principles come into play during a graph traversal which is used to produce the finite search list. In addition, a computational investigation of two methods by which homotopy classes can be named is discussed, and properties of …
-
Retrieval Augmented Chatbots powered by Large Language Models for Semantically Structured Data
… data and healthcare. This thesis introduces a Graph-based RAG approach that leverages the structured nature of graph data to enhance both retrieval and response generation by preserving these semantic relationships. The research focuses on developing conversational question answering systems …
Page 1 of 3