Essays about: "graph partitioning"
Showing result 6 - 10 of 18 essays containing the words graph partitioning.
-
6. 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
-
7. WinBro: A Window and Broadcast-based Parallel Streaming Graph Partitioning Framework for Apache Flink
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : The past years have shown an increasing demand to process data of various kinds and size in real-time. A common representation for many real-world scenarios is a graph, which shows relations between entities, such as users of social networks or pages on the Internet. READ MORE
-
8. Scalable System-Wide Traffic Flow Predictions Using Graph Partitioning and Recurrent Neural Networks
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)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
-
9. Scalable Streaming Graph Partitioning
University essay from KTH/Skolan för informations- och kommunikationsteknik (ICT)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
-
10. 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)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