Essays about: "Directed graphs"
Showing result 1 - 5 of 43 essays containing the words Directed graphs.
-
1. Extending applicability of symbolic execution to uncover possible shared memory transactions in GPU programs
University essay from Linköpings universitet/Institutionen för datavetenskapAbstract : General-purpose computing on the graphics processing unit has become popular since the cost-to-power ratio is lower for GPUs (compared to CPUs) and the programmability of the GPU has increased. CUDA is an extension of the C/C++ programming languages which enables software developers to more easily make use of the computational power of the GPUs. READ MORE
-
2. ESTIMATION OF POINT PROCESSES ON DIRECTED GRAPHS
University essay from Uppsala universitet/Institutionen för informationsteknologiAbstract : Road accidents are one of the most important concerns worldwide. Studying and analysing them is one way to improve and ensure safety on the roads. Traffic accident records for four years have been provided and are analysed in this thesis. READ MORE
-
3. Simulations of Point Processes on Directed Graphs
University essay from Uppsala universitet/Institutionen för informationsteknologiAbstract : Simulating a point process where the events correspond to vehicle collisions on a road networkcan be quite computationally heavy due to the large number of elements that are necessary toprovide a sufficient discretization of the network. This paper aims to present a computationallyefficient solution for simulating events of a point process. READ MORE
-
4. Community Detection in Directed Graphs for Cell-to-Sector Mapping Using Handover Statistics in Mobile Communication Networks
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Many use cases in mobile communication networks are dependent on knowledge of which cells serve the same sector. These use cases include network planning, optimization and troubleshooting. Current methods of obtaining knowledge regarding this cell-to-sector mapping are based on naming conventions of cells. READ MORE
-
5. Damping Factor Analysis for PageRank
University essay from Mälardalens universitet/Akademin för utbildning, kultur och kommunikationAbstract : The purpose of this thesis is to present research related to the damping factor in relation to the PageRank algorithm where a method of symbolic calculations is used to calculate eigenvalues, eigenvectors corresponding to the Google matrix in relation to both directed and undirected graphs. These graphs given comprise all the directed graphs up to four vertices and in addition the undirected graphs of five vertices are given in this thesis. READ MORE
