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 29 for “"Edge Weights"”.
-
Data Procurement for Shortest Paths on Random Graphs
… path between two nodes on a graph with known edge weights, we approach the shortest paths problem for graphs with random edge weights described by known probability distributions. We introduce the idea of a budget of size k which allows us to replace k random edges with numbers drawn from the …
-
Weighted Graph Compression using Genetic Algorithms
… from an epidemic point of view. It is seen that edge weights provide vital information for graph compression. Not only this, but having meaningful edge weights is important as different weights can lead to different results. Moreover, both the original edge weights and adjusted edge weights …
-
Strategic algorithms
… algorithm, which, given a graph with specified edge weights, seeks the path minimizing the total weight from a source to a destination. In practice, the edge weights are often uncertain and it is not even clear what we mean by shortest path anymore: is it the path that minimizes the expected …
-
On the Design, Analysis, and Implementation of Algorithms for Selected Problems in Graphs and Networks
… focus on the case where the number of distinct edge weights is bounded. Using a bucketed data structure to organize the edge weights, we present an efficient algorithm for the MSTV problem, which runs in O (| E| + |V| · K) time, where K is the number of distinct edge weights. When K is a …
-
An Algorithm for Influence Maximization and Target Set Selection for the Deterministic Linear Threshold Model
… nodes. Inputs to our algorithm include edge weights and vertex thresholds. The threshold difference greedy algorithm presented in this thesis takes into account both the edge weights as well as vertex thresholds in computing influence of a node. The threshold difference greedy algorithm …
-
Dynamic partitioning of social networks
… like friendships or conversations, as edges, social networks can be represented as graphs. Partitioning the OSN graph itself is difficult as its power-law degree distribution leads to many cross-partition edges. Moreover, unlike traditional graphs, which are more static, OSN graphs …
-
Determining influence in social networks using Social Capital
… empirically show the superiority of hypergraph edge weights as compared to dyadic edge weights for identifying influencers.To conclude with we discuss a couple of popular distributed programming paradigms, namely MapReduce and BSP (Bulk Synchronous Parallel) and the implementation of the …
-
On the computational power of RNNs
… If we also allow infinite precision, infinite edge weights, and nonlinear output activation functions, we prove that GRUs are at least as computationally powerful as pushdown automata. All results are shown constructively.
-
Unrolling of Graph Total Variation for Image Denoising
… then feature distances are computed to establish edge weights. Given a constructed graph, a convex optimization problem for denoising using a graph total variation prior is formulated. Its solution is interpreted in an iterative procedure as a graph low-pass filter with an analytical frequency …
-
Variations on Zombies and Survivor in Simple Polygons
… On its turn, a zombie can only move on the first edge of a \textit{geodesic} path to the survivor's location. A survivor may choose to move to any vertex adjacent to its current vertex; the objective of the survivor is to survive as long as possible. Both players take turns and have complete …
-
Setting location priors using beamforming improves model comparison in MEG-DCM
… them to nodes and their connection strengths to edge weights. Dynamic Causal Modelling (DCM) presents a Bayesian framework to estimate the parameters of these networks, as well as the ability to test hypotheses on the structure of the network itself using Bayesian model comparison. DCM uses a …
-
Labeled Trees and Spanning Trees: Computational Discrete Mathematics and Applications
… which is a tree of order n with positive integer edge weights such that the weighted distances between pairs of vertices are exactly from 1 to n choose 2. Only five Leech trees are known and some non-existence results have been presented through the years. Variations of Leech trees such as the …
-
Network connectivity tracking for a team of unmanned aerial vehicles
… connectivity can be controlled by altering edge weights through movement of individual UAVs in the team, or by adding and deleting edges. The addition and deletion problem for algebraic connectivity, however, is NP-hard. The contributions of this work are 1) a comparison of four heuristic …
-
Variations of online bipartite matching
… the Online Bipartite Matching problem in which edge weights are calculated as the product of a job value and worker value. It extends this to the Reusable Sequential Stochastic Assignment Problem, in which workers can be reused after they finish processing a job. We consider both the stochastic …
-
Computational crowd camera : enabling remote-vision via sparse collective plenoptic sampling
… photos as vertices of a weighted graph, where edge weights measure similarity or distance between pairs of photos. I introduce Angled Graphs as a new data structure to organize collections of photos in a way that enables the construction of visually smooth paths. Weighted angled graphs extend …
-
Resilient and Risk-Averse Network Systems
… graph structures under stochastic vertex and/or edge weights. First, we consider a network flow problem and propose an approach for developing resilience metrics, where resilience refers to the network’s capability to restore optimal or near-optimal operations following unforeseen (stochastic) …
-
The Polyhedral Geometry of Graphical Designs
… was left with ambiguity, to graphs with positive edge weights. Through Gale duality, we establish a bijection between graphical designs and the face lattices of the eigenpolytopes of a graph. This connection proves the existence of positively weighted graphical designs averaging any collection of …
-
The value of information in shortest path optimization/
… path optimization on a graph with random edge weights.
-
Keep it secret, keep it safe : privacy, security, and robustness in an adversarial world
… graph while preserving the privacy of the edge weights. We also present efficient node-private algorithms for computing the edge density of Erdős-Rényi and concentrated-degree graphs.
-
Approximation algorithms for variants of the traveling salesman problem
… P = NP. However, given the added constraint that edges of the graph observe triangle inequality, it has been shown that it is possible achieve a good approximation to the optimal solution [2]. TSP has a number of variants that have been deeply researched over the years. Approximations of varying …
Page 1 of 2