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 32 for “"weighted graph"”.
-
Weighted Graph Compression using Genetic Algorithms
… Consequently, it is very common for networks/graphs to be large. When graphs get too large, the computational power and time to process these networks gets expensive and inefficient. This is common in areas such as bioinformatics, epidemic contact tracing, social networks, and many others. …
-
Tradespace exploration for space system architectures : a weighted graph framework
… the framework is the generation of a directed, weighted 'tradespace graph' that serves as a model of the architecture decision making process. Vertices in the tradespace graph are defined by pairings of architectures from the tradespace with asset portfolios, which are the sets of the common …
-
The Polyhedral Geometry of Graphical Designs
A graphical design is a quadrature rule for a graph. That is, a graphical design is a subset of graph vertices for which the global averages of certain Laplacian eigenvectors are equal to weighted averages of these vectors over the design subset. This definition was inspired by classical quadrature …
-
Motif Mining On Structured And Semi-structured Biological Data
… in biology such that the data is structured (graphs)and semi-structured (sequences).A challenge of motif mining in sequences is the existence of variationsincluding substitutions and permutations. Taking into account the existenceof these two kinds of variations, we propose a novel sequential …
-
Graphs of Convex Sets with Applications to Optimal Control and Motion Planning
… and convex optimization. We consider graphs where each vertex is paired with a convex program, and each edge couples two programs through additional convex costs and constraints. We call such a graph a Graph of Convex Sets (GCS). Over a GCS we can formulate any optimization problem …
-
A Hierarchical Algorithm for Probabilistically Complete Path Planning in Multi-Floor Environments
… of the space can thus be described as a weighted graph. However, existing planning algorithms for multi-floor environments modeled in this way do not extend the guarantees on completeness and optimality provided by the underlying motion planning algorithms used within the 2D maps. This …
-
Network Behavior Analysis of Spike Timing Dependent Plasticity (STDP) in Simulated Neural Networks
… Timing Dependent Plasticity (STDP) model to the weighted graph output from neural growth simulations and analyzes the resulting spike and weight changes over time. This preliminary investigation establishes a baseline process for understanding the effects of STDP on a neural network and provides …
-
Comparative analysis of deep learning and graph cut algorithms for cell image segmentation
… segmentation algorithm based on the so-called graph cut that addresses the segmentation problem using an energy minimization scheme defined on a weighted graph. Second, we use modern techniques based on deep neural networks, namely U-Net and LSTM that have a time-consuming training and a …
-
Spectral graph theory analysis of software-defined networks to improve performance and security
… which is based on the eigendecomposition of a weighted graph that accounts for the network topology and traffic load. A software-defined network closed-loop control scheme is developed; the scheme is modeled after a closed-loop control system that includes an observer and a controller. A …
-
Computational crowd camera : enabling remote-vision via sparse collective plenoptic sampling
… is common to represent 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 …
-
Active flows and networks
… systems, the spectrum of the underlying graph Laplacian plays a key role in controlling the flow. Spectral graph theory has traditionally prioritized analyzing Laplacians of unweighted networks with specified adjacency properties. For the second part of the thesis, we introduce a …
-
GraphDHT: Scaling Graph Neural Networks' Distributed Training on Edge Devices on a Peer-to-Peer Distributed Hash Table Network
… presents an innovative strategy for distributed Graph Neural Network (GNN) training, leveraging a peer-to-peer network of heterogeneous edge devices interconnected through a Distributed Hash Table (DHT). As GNNs become increasingly vital in analyzing graph-structured data across various domains, …
-
Towards an Integrated Model of the Mental Lexicon
… these studies modeled the mental lexicon as an unweighted graph. In this thesis, I expand upon these works by proposing a model that incorporates several word features into a weighted network. Analyses on this model applied to the English lexicon show that while this model does not exhibit the …
-
Keep it secret, keep it safe : privacy, security, and robustness in an adversarial world
… despite adversarial perturbations, for cryptographic tasks involving secure multiparty computation and anonymity-preserving authentication, and for privacy-preserving analysis of networks. The results presented span the fields of distributed algorithms, cryptography, and differential privacy. …
-
A study of graph partitioning techniques for fast indexing and query processing of a large RDF graph
… The collection of triples together represents a graph. Many techniques have been developed for RDF indexing and query processing and the most popular among them store and process RDF data using an RDBMS. In this thesis, we study the impact of existing graph partitioning techniques on indexing and …
-
Building detection in SAR imagery
… allows the problem to be solved from a connected graph viewpoint, where the nodes are the bright lines and shadows and the arcs are the connections between bright lines and shadows. For the first technique (simple graph grouping), constraints based on angle of depression and the relationship …
-
A general computational tool for structure synthesis
… concepts: (1) the structure is represented by a graph and further by the adjacency matrix; and (2) instead of only exploiting the eigenvalue of the adjacency matrix, both the eigenvalue and the eigenvector are exploited; specifically the components of the eigenvector have been found very useful …
-
Cluster algebras and discrete integrable systems
… et al. 2016). We study a discrete dynamic on weighted bipartite graphs on a torus, analogous to dimer integrable systems of Goncharov and Kenyon 2013. We show that all Hamiltonians, partition functions of all weighted perfect matchings with a common homology class, are invariant under a move …
-
Extending the Birkhoff-von Neumann switching strategy to multicast switching
… the BVN strategy to multicast switching. Using a graph theoretic model, we show that the capacity region for a traffic pattern is precisely the stable set polytope of the pattern's "conflict graph", in the no-fanout-splitting case. We construct examples to show that, if dynamic fanout splitting is …
-
Upper and lower bounds for the fixed spectrum frequency assignment problem
… problem, can be represented by an undirected weighted graph.<br/><br/>A summary of some of the integer programming formulations which model the problem is presented, together with a brief dimensional study of them. <br/><br/>An efficient implementation of two well-known metaheuristic …
Page 1 of 2