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 Algorithm"”.
-
Minimum energy path planning for ad hoc networks
… We characterize this problem and introduce two algorithms. The first is a recursive algorithm useful for problems with one communication node. We show the limitations of this algorithm and how it can find suboptimal paths. The second algorithm, the discretized graph algorithm, can be applied to …
-
A reduced visibility graph approach for motion planning of autonomously guided vehicles
… static and dynamic environments.<br/><br/>Two algorithms are proposed for solving the aforementioned problems. The first algorithm establishes the shortest collision-semi-free path for an AGV from its start point to its goal point, in a two-dimensional static environment populated by simple …
-
Supervised manifold distance segmentation
… measures are studied and experimented. Graph algorithm and probabilistic classification are involved. Both time and space complexity of this algorithm is O(N). With appropriate choice of feature vector, this method could produce similar qualitative and quantitative results to other …
-
Bayesian Modeling of a High Resolution Housing Price Index
… distance, we propose an optimization based graph algorithm to discover neighborhoods of houses that have similar attributes and are closely connected by roads. Our discovered regions are at a finer scale than census tracts, and even in this case our methods described above produce a house …
-
Graph Analytics with Data Science Languages
… which require new approaches, tools, and algorithms to analyze data. The most complex exploration mechanism in Big Data Analytics is graphs, which are flexible to represent any set of interconnected objects. Graph analytics is particularly challenging mainly due to large graph sizes and …
-
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 …
-
A visualized framework for representing uncertain and incomplete temporal knowledge
… visually transformed into a corresponding Time Graph, supported by automatic consistency checker that derives a verdict to confirm if a given scenario is temporally consistent or inconsistent. The thesis provides the following contributions: 1. Extended graphical representation for uncertain and …
-
Solutions for graph compression problems and applications
Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2025-05-01
-
Modelling and Design of Resilient Networks under Challenges
… choices for the current and Future Internet. Graph models to analyse critical infrastructures are examined and a multilevel graph model is developed to study interdependencies between different networks. Furthermore, graph-theoretic heuristic optimisation algorithms are developed. These …
-
New sublinear methods in the struggle against classical problems
… the time and query complexity of approximation algorithms that access only a minuscule fraction of the input, focusing on two classical sources of problems: combinatorial graph optimization and manipulation of strings. The tools we develop find applications outside of the area of sublinear …
-
Applications of a Novel Sampling Technique to Fully Dynamic Graph Algorithms
… technique to building fully-dynamic randomized graph algorithms. We present the following results: \begin{enumerate} \item A randomized algorithm to estimate the size of a cut in an undirected graph $G = (V, E)$ where $V$ is the set of nodes and $E$ is the set of edges and $n = |V|$ and $m = …