Avancerad sökning

Visar resultat 1 - 5 av 29 uppsatser som matchar ovanstående sökkriterier.

  1. 1. Language Theoretic Properties of Graph Extension Languages : An Investigation of Graph Extension Grammars with Context Matching and Logic

    Master-uppsats, Umeå universitet/Institutionen för datavetenskap

    Författare :Yannick Stade; [2022]
    Nyckelord :graph language; formal language; theoretical computer science;

    Sammanfattning : Graph extension grammars provide a way to define graph languages. They consist of a regular tree grammar and an algebra. The regular tree grammar generates trees, so-called derivation trees. Those are evaluated by the algebra into a set of graphs. LÄS MER

  3. 2. Serverless Streaming Graph Analytics with Flink Stateful Functions

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

    Författare :Sihan Chen; [2022]
    Nyckelord :Temporal Graph; Graph Analytics; Flink Stateful Functions; Serverless; FaaS;

    Sammanfattning : Serverless Function as a Service (FaaS) platforms have been an emerging trend nowadays with the continuous improvement of the cloud-native ecosystem. Graph streaming analytics is a widely-known research area that demands well-designed computation paradigms and complex optimization of storage and queries. LÄS MER

  4. 3. Semi-supervised Sentiment Analysis for Sentence Classification

    Master-uppsats, Uppsala universitet/Institutionen för lingvistik och filologi

    Författare :Eirini Tsakiri; [2022]
    Nyckelord :sentiment analysis; text classification; semi-supervised learning; machine learning;

    Sammanfattning : In our work, we deploy semi-supervised learning methods to perform Sentiment Analysis on a corpus of sentences, meant to be labeled as either happy, neutral, sad, or angry. Sentence-BERT is used to obtain high-dimensional embeddings for the sentences in the training and testing sets, on which three classification methods are applied: the K-Nearest Neighbors classifier (KNN), Label Propagation, and Label Spreading. LÄS MER

  5. 4. Linear Programming Algorithms for Multi-commodity Flow Problems

    Kandidat-uppsats, KTH/Fysik

    Författare :Isaac Rosenberg Enquist; Phillip Sjögren; [2022]
    Nyckelord :Multi-commodity Flow Problem; Linear Programming; Linear Optimization; Simplex; Interior-point Method; Graph Theory; Optimization Theory; Transportation Problems;

    Sammanfattning : A multi-commodity flow problem consists of moving several commodities from their respective sources to their sinks through a network where each edge has different costs and capacity constraints. This paper explores different linear programming algorithms and their performance regarding finding an optimal solution for multi-commodity flow problems. LÄS MER

  7. 5. Categorization of songs using spectral clustering

    Kandidat-uppsats, KTH/Skolan för teknikvetenskap (SCI)

    Författare :Felix Darke; Linus Below Blomkvist; [2021]
    Nyckelord :;

    Sammanfattning : A direct consequence of the world becoming more digital is that the amount of available data grows, which presents great opportunities for organizations, researchers and institutions alike.However, this places a huge demand on efficient and understandable algorithms for analyzing vast datasets. LÄS MER