Essays about: "graph partitioning"

Showing result 1 - 5 of 13 essays containing the words graph partitioning.

  1. 1. Scalable System-Wide Traffic Flow Predictions Using Graph Partitioning and Recurrent Neural Networks

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Jón Reginbald Ivarsson; [2018]
    Keywords : Traffic Flow Prediction; Machine Learning; Recurrent Neural Network; Graph Partitioning; Big Data; Trafikprognoser; Maskininlärning; Återkommande Neuralt Nätverk; Graf Partitionering; Big Data;

    Abstract : Traffic flow predictions are an important part of an Intelligent Transportation System as the ability to forecast accurately the traffic conditions in a transportation system allows for proactive rather than reactive traffic control. Providing accurate real-time traffic predictions is a challenging problem because of the nonlinear and stochastic features of traffic flow. READ MORE

  2. 2. Scalable Streaming Graph Partitioning

    University essay from KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Author : Seyed Mohammadreza Seyed Khamoushi; [2017]
    Keywords : streaming graph; vertex-cut partitioning; graph partitioning; distributed hash table;

    Abstract : Large-scale graph-structured datasets are growing at an increasing rate. Social network graphs are an example of these datasets. Processing large-scale graphstructured datasets are central to many applications ranging from telecommunication to biology and has led to the development of many parallel graph algorithms. READ MORE

  3. 3. Streaming Graph Partitioning : Degree Project in Distributed Computing at KTH Information and Communication Technology

    University essay from KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Author : Zainab Abbas; [2016]
    Keywords : ;

    Abstract : Graph partitioning is considered to be a standard solution to process huge graphs efficiently when processing them on a single machine becomes inefficient due to its limited computation power and storage space. In graph partitioning, the whole graph is divided among different computing nodes that process the graph in parallel. READ MORE

  4. 4. Measuring the extent of interdisciplinary research and creating a collaboration group structure at KTH

    University essay from KTH/Skolan för datavetenskap och kommunikation (CSC); KTH/Skolan för datavetenskap och kommunikation (CSC)

    Author : Agnes Åman; Hanna Nyblom; [2016]
    Keywords : ;

    Abstract : With interdisciplinary research being a possibility in modern research environ- ments, it is interesting to optimise collaborations between researchers in order to further develop the research environment. The scope of this thesis was therefore to develop a method to measure how widespread the interdisciplinary research is and to propose collaboration groups of researchers created by the use of graph theory. READ MORE

  5. 5. Distributed balanced edge-cut partitioning of large graphs having weighted vertices

    University essay from KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Author : Johan Elander Aman; [2015]
    Keywords : ;

    Abstract : Large scale graphs are sometimes too big to store and process on a single machine. Instead, these graphs have to be divided into smaller parts and distributed over several machines, while minimizing the dependency between the different parts. This is known as the graph partitioning problem, which has been shown to be NP-complete. READ MORE