Essays about: "graph partition"
Showing result 1 - 5 of 13 essays containing the words graph partition.
-
1. Highly Available Task Scheduling in Distinctly Branched Directed Acyclic Graphs
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Big data processing frameworks utilizing distributed frameworks to parallelize the computing of datasets have become a staple part of the data engineering and data science pipelines. One of the more known frameworks is Dask, a widely utilized distributed framework used for parallelizing data processing jobs. READ MORE
-
2. Using machine learning to visualize and analyze attack graphs
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : In recent years, the security of many corporate networks have been compromised by hackers who managed to obtain important information by leveraging the vulnerabilities of those networks. Such attacks can have a strong economic impact and affect the image of the entity whose network has been attacked. READ MORE
-
3. Approaching sustainable mobility utilizing graph neural networks
University essay from Högskolan i Halmstad/Akademin för informationsteknologiAbstract : This report is done in collaboration with WirelessCar for the master of science thesis at Halmstad University. Many different parameters influence fuel consumption. The objective of the report is to evaluate if Graph neural networks are a practical model to perform fuel consumption prediction on areas. READ MORE
-
4. Streaming Graph Partitioning with Graph Convolutional Networks
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : In this work, we present a novel approach to the streaming graph partitioning problem which handles unbounded streams.Graph partitioning is a process of dividing a graph into groups of nodes or edges. READ MORE
-
5. Map Partition and Loop Closure in a Factor Graph Based SAM System
University essay from Linköpings universitet/ReglerteknikAbstract : The graph-based formulation of the navigation problem is establishing itself as one of the standard ways to formulate the navigation problem within the sensor fusion community. It enables a convenient way to access information from previous positions which can be used to enhance the estimate of the current position. READ MORE