Sökning: "acyclic"

Visar resultat 16 - 20 av 37 uppsatser innehållade ordet acyclic.

  1. 16. Dynamic Programming Algorithms for Semantic Dependency Parsing

    Master-uppsats, Linköpings universitet/Interaktiva och kognitiva system

    Författare :Nils Axelsson; [2017]
    Nyckelord :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;

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

  3. 17. Analysis of task scheduling for multi-coreembedded systems

    Master-uppsats, KTH/Maskinkonstruktion (Inst.)

    Författare :JOSÉ LUIS GONZÁLEZ-CONDE PÉREZ; [2017]
    Nyckelord :;

    Sammanfattning : This thesis performs a research on scheduling algorithms for parallel applications. The main focus is their usage on multi-core embedded systems’ applications. A parallel application can be described by a directed acyclic graph. LÄS MER

  4. 18. Generation of Abstract Meaning Representations by Hyperedge Replacement Grammars – A Case Study

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

    Författare :Anna Jonsson; [2016]
    Nyckelord :;

    Sammanfattning : The abstract meaning representation (AMR) is a graph-based semantic representation of a natural language sentence that has been the target of numerous studies – in particular, a collection of such graphs over a small domain including the words boy, girl, want and believe has been presented. We investigate the suitability of two hyperedge replacement grammar based formalisms for the generation of AMRs in the form of a case study using the aforementioned boy-girl domain. LÄS MER

  5. 19. Approximate Bayesian Learning of Partition Directed Acyclic Graphs

    Master-uppsats, KTH/Matematisk statistik

    Författare :Karl Amundsson; [2016]
    Nyckelord :;

    Sammanfattning : Partition directed acyclic graphs (PDAGs) is a model whereby the conditional probability tables (CPTs) are partitioned into parts with equal probability. In this way, the number of parameters that need to be learned can be significantly reduced so that some problems become more computationally feasible. LÄS MER

  7. 20. Deep Learning with a DAG Structure for Segmentation and Classification of Prostate Cancer

    Master-uppsats, Lunds universitet/Matematik LTH

    Författare :Gabrielle Flood; [2016]
    Nyckelord :Deep learning; convolutional neural networks; CNN; directed acyclic graph; DAG; prostate cancer; Technology and Engineering;

    Sammanfattning : Deep learning is a machine learning technique inspired by the biological nervous system. The method has been used more and more over the last decades. Within this thesis, convolutional neural networks (CNN:s) are used for Gleason classification of prostate cancer in histopathological images. LÄS MER