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 Compression"”.
-
Attack graph compression
Attack graph has emerged as a useful tool for defending against multi-step network attacks involving correlated vulnerabilities. However, most current representations of attack graphs are not scalable [35]. Even the attack graph of a reasonably large network is usually incomprehensible to the human …
-
Time Evolving Graph Compression
Σύγχρονα συστήματα επεξεργασίας δεδομένων που δίνουν δυνατότητες αλληλεπίδρασης και μοντελοποιούν συσχετισμούς μεταξύ χρηστών παίζουν αποφασιστικό ρόλο στη σημερινή εποχή. Τροφοδοτούν καθημερινές ανθρώπινες δραστηριότητες, βοηθούν στον καθορισμό της παγκόσμιας επικοινωνίας και συμβάλλουν στη …
-
Universal graph compression : stochastic block models
… of processing and mining large-scale graph data such as social networks, web graphs, and biological networks, as well as the high I/O and communication costs of storing and transmitting such data, this thesis investigates lossless compression of data appearing in the form of a labeled …
-
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. …
-
Graph compression using heuristic-based reordering
… relatedqueries. We consider the generic case of graph storage using Inverted Index and compressing themusing this format. Graph compression by reordering has been done using traversal and clusteringbased techniques. In generic methods, the graph is reordered to arrive at new identifiers for …
-
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
-
Overcoming Memory Capacity Constraints for Large Graph Applications on GPUs
Graphics Processing Units (GPUs) have been used successfully for accelerating a wide variety of applications in the domains of scientific computing, machine learning, and data analytics over the last decade. Two important trends that have emerged across these domains are that for a lot of …
-
Algorithms and Hardness Results for Compressing Graphs with Distance Constraints
Graphs have been widely utilized in network design and other applications. A natural question is, can we keep as few edges of the original graph as possible, but still make sure that the vertices are connected within certain distance constraints. In this thesis, we will consider different versions …
-
Implementation of Minimum Edge Constraints Sets for Proximity Graphs
… algorithms, not every edge of the resulting graph needs to be explicitly stored. This has implications for graph compression. We examine the application and runtime performance on minimum edge-constrained algorithms for three proximity graph types: Delaunay triangulation, Gabriel graph and …
-
A methodology for automating graph construction and evaluation
Graphs and graph analytics facilitate new approaches to machine learning. They also provide the ability to extract new insights from the same datasets as used in traditional machine learning experiments. For this reason, many researchers are seeking to exploit graph databases in pursuit of better …
-
Transversal Problems In Sparse Graphs
Graph transversals are a classical branch of graph algorithms. In such a problem, one seeks a minimum-weight subset of nodes in a node-weighted graph $G$ which intersects all copies of subgraphs~$F$ from a fixed family $\mathcal F$. In the first portion of this thesis we show two results related to …
-
Finding correlations and independences in omics data
… on the identification of clusters, the sub-graphs of graphs: A parameter-free graph clustering algorithm was developed, which was based on the concept of graph compression, in order to find sets of highly interlinked proteins sharing similar characteristics. The study of lipids (lipidome) …
-
Information-theoretic analysis of the complexity and compression of network topologies
… types of networks such as social networks etc. Graph theory has always been the primary mathematical tool for simulating networks. Traditional ways of storing graphs are known to be very complex, even for small graphs. When faced with graphs with millions of nodes, we are inevitably faced with …
-
Modelling the placenta from the bottom up: digital phenotyping of human placenta histology
… and cell classes, I construct a whole slide cell graph that mirrors cellular community interaction within micro-anatomical tissue structures. I develop a scalable graph neural network which uses constituent cells to predict one of 9 tissue microstructures in the placenta parenchyma.</p> <p>The …
-
Parallel Algorithms for Counting Problems on Graphs Using Graphics Processing Units
The availability of Graphics Processing Units (GPUs) with multicore architecture have enabled parallel computations using extensive multi-threading. Recent advancements in computer hardware have led to the usage of graphics processors for solving general purpose problems. Using GPUs for computation …
-
Compressing and Performing Algorithms on Massively Large Networks
… structures and algorithms, or we need to develop compressions that require much less space while still being able to answer queries efficiently. In this dissertation, we develop several compression techniques that succinctly represent these real-world networks while still being able to efficiently …
-
Faster graph algorithms via switching classes
… that the runtimes of the first generation of graph algorithms were expressed as functions of n := |V|. This analysis was natural since at this time graphs were represented in n2 space via their adjacency matrix. It was soon noticed that if m := |E| = o(n2), then a variety of graph algorithms …
-
Data visualization and interaction on smartwatch small screens
… optimization of a small display while presenting graphic data such as line charts. Due to the small screen of smartwatches presenting the data could be challenging. To overcome these challenges, I will propose two techniques, Compression and Simplification, to improve the visualization techniques …
-
Um modelo de grafos de topologias combinadas de para segmentação de imagens via compressão de grafos
Um desafio na área de segmentação de imagens é o problema de escalabilidade, onde muitos métodos atuais enfrentam problemas de complexidade computacional e/ou de memória ao lidar com imagens em alta resolução. Motivado para enfrentar esse desafio, este trabalho propõe uma nova abordagem de modelos …
Page 1 of 2