Sökning: "Graph sampling"

Visar resultat 1 - 5 av 8 uppsatser innehållade orden Graph sampling.

  1. 1. Comparison study on graph sampling algorithms for interactive visualizations of large-scale networks

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Alexandra Voroshilova; [2019]
    Nyckelord :Graph sampling; graph filtering; large graph visualization; grafreduktion; stor graf visualisering;

    Sammanfattning : Networks are present in computer science, sociology, biology, and neuroscience as well as in applied fields such as transportation, communication, medical industries. The growing volumes of data collection are pushing scalability and performance requirements on graph algorithms, and at the same time, a need for a deeper understanding of these structures through visualization arises. LÄS MER

  2. 2. Multi-scale clustering in graphs using modularity

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Bertrand Charpentier; [2019]
    Nyckelord :Hierarchical clustering; Multi-scale clustering; Graph; Modularity; Resolution; Dendrogram;

    Sammanfattning : This thesis provides a new hierarchical clustering algorithm for graphs, named Paris, which can be interpreted through the modularity score and its resolution parameter. The algorithm is agglomerative and based on a simple distance between clusters induced by the probability of sampling node pairs. LÄS MER

  3. 3. Dynamic Path Planning for Autonomous Unmanned Aerial Vehicles

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Urban Eriksson; [2018]
    Nyckelord :Path planning; RRT; RRT*; UAV;

    Sammanfattning : This thesis project investigates a method for performing dynamic path planning in three dimensions, targeting the application of autonomous unmanned aerial vehicles (UAVs).  Three different path planning algorithms are evaluated, based on the framework of rapidly-exploring random trees (RRTs): the original RRT, RRT*, and a proposed variant called RRT-u, which differs from the two other algorithms by considering dynamic constraints and using piecewise constant accelerations for edges in the planning tree. LÄS MER

  4. 4. Undersökning och framtagning av hårdvara för ONE Demand

    Kandidat-uppsats, Lunds universitet/Högskoleingenjörsutbildning i datateknik

    Författare :Haris Hadzimesinovic; Dardan Behrami; [2017]
    Nyckelord :enkortsdator; gui; raspberry pi; energiförbrukning; kwh; Technology and Engineering;

    Sammanfattning : This thesis was done in collaboration with, and on behalf of, One Nordic AB. The purpose was to examine the system One Demand, a system used for sampling measurement data, to begin the development of a new version of the system. The new system is comprised of two parts, a central unit and a graphical user interface. LÄS MER

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

    Master-uppsats, KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Författare :Johan Elander Aman; [2015]
    Nyckelord :;

    Sammanfattning : 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. LÄS MER