Blar i Department of Informatics på tittel

Viser treff 1-20 av 881

    • A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion 

      Lokshtanov, Daniel; Misra, Pranabendu; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket (Journal article; Peer reviewed, 2020)
      In the Split Vertex Deletion (SVD) problem, the input is an n-vertex undirected graph G and a weight function w: V(G) → ℕ, and the objective is to find a minimum weight subset S of vertices such that G-S is a split graph ...

    • A 43k Kernel for Planar Dominating Set using Computer-Aided Reduction Rule Discovery 

      Halseth, Johan Torås (Master thesis, 2016-02-15)
      In this thesis we explore the technique of Region Decomposition for finding kernels for Planar Dominating Set. We redefine some concepts used in earlier work, fixing some ambiguities on the way. From those concepts we end ...

    • A Domain-Specific Language for the Development of Heterogeneous Multi-Robot Systems 

      Losvik, Daniel Steen (Master thesis, 2019-06-28)
      Robots are becoming more advanced each year and will increasingly become a bigger part of our lives. This thesis explores how model-driven software engineering can be used in the development of heterogeneous multi-robot ...

    • A Modular Approach for Creating Web Applications with 3D Geology Using React and X3DOM 

      Eriksen, Tomas Fjugstad (Master thesis, 2019-06-29)
      The thesis details the work for creating a web application that allows a user to see a visualization for geological data like topography, seismic data and well measurements from the subsurface. This application uses the ...

    • A Snakemake workflow for analysing alternative splicing events from short-read RNA-seq data 

      Holberg, Madelen (Master thesis, 2022-04-13)

    • A Visual Analytics Dashboard for Mental Health Therapists 

      Grieg, Nikolai Alexander (Master thesis, 2019-06-29)
      Mental health disorders are a significant problem throughout the western world. Cognitive Behavioral Therapy (CBT) is a common treatment form for these disorders. Internet-based Cognitive Behavioral Therapy (iCBT) provides ...

    • A workflow-integrated brain tumor segmentation system based on fastai and MONAI 

      Digernes, Jostein Rådmannsøy; Ditlev-Simonsen, Carsten (Master thesis, 2022-06-01)
      Artificial intelligence (AI) has achieved great results in medical imaging tasks and has the potential to improve the experiences of clinicians and patients in the future, but on the way toward AI integration in medicine, ...

    • Abstractions for Language-Independent Program Transformations 

      Kalleberg, Karl Trygve (Doctoral thesis, 2007-06-27)

    • Accuracy and efficiency of germline variant calling pipelines for human genome data 

      Zhao, Sen; Agafonov, Oleg; Azab, Abdulrahman; Stokowy, Tomasz; Hovig, Eivind (Journal article; Peer reviewed, 2020)
      Advances in next-generation sequencing technology have enabled whole genome sequencing (WGS) to be widely used for identification of causal variants in a spectrum of genetic-related disorders, and provided new insight into ...

    • Accurate analysis of genuine CRISPR editing events with ampliCan 

      Labun, Kornel; Guo, Xiaoge; Chavez, Alejandro; Church, George M.; Gagnon, James A.; Valen, Eivind (Peer reviewed; Journal article, 2019)
      We present ampliCan, an analysis tool for genome editing that unites highly precise quantification and visualization of genuine genome editing events. ampliCan features nuclease-optimized alignments, filtering of experimental ...

    • Acyclic, star, and injective colouring: bounding the diameter∗ 

      Brause, Christoph; Golovach, Petr; Martin, Barnaby; Ochem, Pascal; Paulusma, Daniël; Smith, Siani (Journal article; Peer reviewed, 2022)
      We examine the effect of bounding the diameter for a number of natural and well-studied variants of the COLOURING problem. A colouring is acyclic, star, or injective if any two colour classes induce a forest, star forest ...

    • An adaptive heuristic for Feeder Network Design with optional transshipment 

      Bergmann, Morten; Msakni, Mohamed Kais; Hemmati, Ahmad; Fagerholt, Kjetil (Journal article; Peer reviewed, 2023)
      This paper studies the Feeder Network Design Problem (FNDP), which considers the design of a minimum cost liner shipping network for the transportation of cargo (containers) between a given hub port and a set of feeder ...

    • Additive Schwarz preconditioner for the finite volume element discretization of symmetric elliptic problems 

      Marcinkowski, Leszek; Rahman, Talal; Loneland, Atle; Valdman, Jan (Peer reviewed; Journal article, 2015-09-25)
      A symmetric and a nonsymmetric variant of the additive Schwarz preconditioner are proposed for the solution of a class of finite volume element discretization of the symmetric elliptic problem in two dimensions, with large ...

    • Algebraic Attack on Small Scale Variants of AES using Compressed Right Hand Sides 

      Indrøy, John Petter (Master thesis, 2018-04-07)
      The Advanced Encryption Standard is probably the most used symmetric encryption cipher in use today, which makes it particularly interesting for cryptanalysis. This thesis attacks smallscale variants of AES through a ...

    • Algebraic Cryptanalysis of Cryptographic Schemes with Extension Field Structure 

      Øygarden, Morten (Doctoral thesis, 2021-09-06)
      Post-Quantum Cryptography studies cryptographic algorithms that quantum computers cannot break. Recent advances in quantum computing have made this kind of cryptography necessary, and research in the field has surged over ...

    • Algebraic Reasoning About Timeliness 

      Haeri, Seyed Hossein; Thompson, Peter W; Van Roy, Peter; Haveraaen, Magne; Davies, Neil J; Barash, Mikhail; Hammond, Kevin; Chapman, James (Journal article; Peer reviewed, 2023)
      Designing distributed systems to have predictable performance under high load is difficult because of resource exhaustion, non-linearity, and stochastic behaviour. Timeliness, i.e., delivering results within defined time ...

    • Algorithmic Complexity of Clustering and Low-Rank Approximation Problems 

      Simonov, Kirill (Doctoral thesis, 2021-03-29)
      The two most popular unsupervised learning problems are k-Clustering and Low-Rank Approximation. Consider a set of n datapoints, in the k-Clustering problem, the objective is to partition these points into k clusters and ...

    • An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL 

      Fomin, Fedor; Golovach, Petr; Stamoulis, Giannos; Thilikos, Dimitrios M. (Journal article; Peer reviewed, 2020)
      In general, a graph modification problem is defined by a graph modification operation ⊠ and a target graph property 𝒫. Typically, the modification operation ⊠ may be vertex removal, edge removal, edge contraction, or edge ...

    • Algorithms for covering multiple submodular constraints and applications 

      Chekuri, Chandra; Inamdar, Tanmay Nitin; Quanrud, Kent; Varadarajan, Kasturi; Zhang, Zhao (Journal article; Peer reviewed, 2022)
      We consider the problem of covering multiple submodular constraints. Given a finite ground set N, a weight function \(w: N \rightarrow \mathbb {R}_+\), r monotone submodular functions \(f_1,f_2,\ldots ,f_r\) over N and ...

    • Algorithms for Linearly Ordered Boolean Formulas 

      Egeland, Christian (Master thesis, 2016-06-30)
      This thesis considers a class of propositional boolean formulas on which various problems related to satisfiability are efficiently solvable by a dynamic programming algorithm. It mainly consists of two larger parts: the ...