Advanced search

Showing result 1 - 5 of 6 essays matching the above criteria.

  1. 1. Preserving the Mental Map when Visualizing Dynamic Graphs : An Approach for Intermediate Representations in the C2 Java Compiler

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

    Author : Emmy Yin; [2023]
    Keywords : Dynamic Graphs; Graph Layout Algorithms; Visualization; Hierarchical Graph Layouts; Dynamiska grafer; grafritningsalgoritmer; visualisering; hierarkiska grafritningar;

    Abstract : Graphs are powerful data structures that are widely used to represent complex forms of information. One area in which graphs are successfully being used is within compiler engineering, where a program under compilation can be represented as a graph that changes as the program is being compiled. READ MORE

  3. 2. Graph Bandits : Multi-Armed Bandits with Locality Constraints

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

    Author : Kasper Johansson; [2022]
    Keywords : Multi-armed bandits; locality constraints; reinforcement learning; Flerarmade banditer; lokala restriktioner; förstärkningsinlärning;

    Abstract : Multi-armed bandits (MABs) have been studied extensively in the literature and have applications in a wealth of domains, including recommendation systems, dynamic pricing, and investment management. On the one hand, the current MAB literature largely seems to focus on the setting where each arm is available to play at each time step, and ignores how agents move between the arms. READ MORE

  4. 3. Traffic Prediction From Temporal Graphs Using Representation Learning

    University essay from KTH/Matematisk statistik

    Author : Andreas Movin; [2021]
    Keywords : Dynamic time warping DTW ; embedding; graph convolutional networks GCN ; graph neural networks GNN ; persistent homology; spectral graph theory; temporal graphs; topological data analysis TDA ; Dynamisk time warping DTW ; inbäddning; convolutional grafnätverk GCN ; neurala grafnätverk GNN ; persistent homologi; spektral graf teori; dynamisk graf; topologisk dataanalys TDA ;

    Abstract : With the arrival of 5G networks, telecommunication systems are becoming more intelligent, integrated, and broadly used. This thesis focuses on predicting the upcoming traffic to efficiently promote resource allocation, guarantee stability and reliability of the network. READ MORE

  5. 4. Dynamic Graph Embedding on Event Streams with Apache Flink

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

    Author : Massimo Perini; [2019]
    Keywords : Dynamic Graph; Representation Learning; Stream; Real-Time Data Processing; Scalable Graph Processing; Graph Neural Network; Experience Replay; Grafi dinamici; Representation Learning; Flussi di dati; Elaborazione in tempo reale; Elaborazione di grafi scalabile; Reti neurali per grafi; Experience Replay; Dynamisk graf; Representationsinlärning; ström; databehandling i realtid; skalbar grafbehandling; grafiskt neuralt nätverk; erfarenhetsåterspelning;

    Abstract : Graphs are often considered an excellent way of modeling complex real-world problems since they allow to capture relationships between items. Because of their ubiquity, graph embedding techniques have occupied research groups, seeking how vertices can be encoded into a low-dimensional latent space, useful to then perform machine learning. READ MORE

  6. 5. Dynamic Programming Algorithms for Semantic Dependency Parsing

    University essay from Linköpings universitet/Interaktiva och kognitiva system

    Author : Nils Axelsson; [2017]
    Keywords : semantic dependency parsing; machine learning; parsing; logic; deduction system; crossing edges; SemEval; coverage; crossing arcs; graph; graph class; non-crossing; QAC; quartic; acyclic; semantisk dependensparsning; maskininlärning; parsning; logik; deduktionssystem; korsande bågar; SemEval; täckning; korsande kanter; graf; grafklass; ickekorsande; QAC; kvartiskt; acykliskt;

    Abstract : Dependency parsing can be a useful tool to allow computers to parse text. In 2015, Kuhlmann and Jonsson proposed a logical deduction system that parsed to non-crossing dependency graphs with an asymptotic time complexity of O(n3), where “n” is the length of the sentence to parse. READ MORE