Blar i Department of Informatics på tittel

Viser treff 17-36 av 927

    • 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 ...

    • Algorithms for rainbow vertex colouring diametral path graphs 

      Dyrseth, Jakob (Master thesis, 2022-06-01)

    • Algorithms for the Rainbow Vertex Coloring Problem on Graph Classes 

      Lima, Paloma T.; van Leeuwen, Erik Jan; van der Wegen, Marieke (Journal article; Peer reviewed, 2020)
      Given a vertex-colored graph, we say a path is a rainbow vertex path if all its internal vertices have distinct colors. The graph is rainbow vertex-connected if there is a rainbow vertex path between every pair of its ...

    • Aligning a Splice Graph to a Genomic Sequence 

      Ølberg, Øyvind (Master thesis, 2005-06-01)

    • An Automated Method for Converting 3D Meshes into Editable 2D Vector Graphics 

      Ure, Vidar Hartveit (Master thesis, 2019-06-29)

    • An Indoor/Outdoor Air Quality Relationship Analysis Using Internet of Things 

      Haug, Lars Henrik (Master thesis, 2019-06-29)
      Exposure to high levels of air pollution is a significant cause of premature mortality. In Norway, people spend about 90% of their time indoors. Therefore, the relationship between indoor and outdoor concentrations of air ...

    • Analysis of Trivium Using Compressed Right Hand Side Equations 

      Schilling, Thorsten Ernst; Raddum, Håvard (Chapter; Peer reviewed, 2012)
      We study a new representation of non-linear multivariate equations for algebraic cryptanalysis. Using a combination of multiple right hand side equations and binary decision diagrams, our new representation allows a very ...

    • Analysis, classification and construction of optimal cryptographic Boolean functions 

      Villa, Irene (Doctoral thesis, 2021-01-04)
      Modern cryptography is deeply founded on mathematical theory and vectorial Boolean functions play an important role in it. In this context, some cryptographic properties of Boolean functions are defined. In simple terms, ...

    • Annotating otoliths with a deep generative model 

      Bojesen, Troels Arnfred; Denechaud, Côme; Malde, Ketil (Journal article; Peer reviewed, 2023)
      Otoliths are a central information source for fish ecology and stock management, conveying important data about age and other life history for individual fish. Traditionally, interpretation of otoliths has required skilled ...

    • Application of quantitative transcriptomics in evaluating the ex vivo effects of per- and polyfluoroalkyl substances on Atlantic cod (Gadus morhua) ovarian physiology 

      Khan, Essa Ahsan; Zhang, Xiaokang; Hanna, Eileen Marie; Yadetie, Fekadu; Jonassen, Inge; Goksøyr, Anders; Arukwe, Augustine (Journal article; Peer reviewed, 2021)
      Because of their global consumption and persistence, per- and polyfluoroalkyl substances (PFASs), are ubiquitously distributed in the environment, as well as in wildlife and humans. In the present study, we have employed ...

    • Applying Gamification and Virtual Reality to an MRSA Infection Control Guideline 

      Bråten, Oskar Elias; Igesund, Trygve Eide (Master thesis, 2020-06-10)
      MRSA is a group of harmful bacteria with resistance to many important antibiotics. Infections are hard to treat and often result in prolonged hospital stays, leading to increased costs and mortality. Like with many other ...

    • An Approach to Flexible Multilevel Modelling 

      Macias, Fernando; Rutle, Adrian; Stolz, Volker; Rodriguez-Echeverria, Roberto; Wolter, Uwe Egbert (Peer reviewed; Journal article, 2018-07-12)
      Multilevel modelling approaches tackle issues related to lack of flexibility and mixed levels of abstraction by providing features like deep modelling and linguistic extension. However, the lack of a clear consensus on ...

    • Approximating Acyclicity Parameters of Sparse Hypergraphs 

      Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios (Peer reviewed; Journal article, 2009)
      The notions of hypertree width and generalized hypertree width were introduced by Gottlob, Leone, and Scarcello (PODS'99, PODS'01) in order to extend the concept of hypergraph acyclicity. These notions were further generalized ...

    • Approximating cube roots of integers, after Heron’s Metrica III.20 

      Steihaug, Trond; Rogers, D. G. (Peer reviewed; Journal article, 2013)

    • Approximation algorithms in combinatorial scientific computing 

      Pothen, Alex; Ferdous, SM; Manne, Fredrik (Journal article; Peer reviewed, 2019)
      We survey recent work on approximation algorithms for computing degreeconstrained subgraphs in graphs and their applications in combinatorial scientific computing. The problems we consider include maximization versions of ...

    • Approximation in (poly-) logarithmic space 

      Biswas, Arindam; Raman, Venkatesh; Saurabh, Saket (Journal article; Peer reviewed, 2020)
      We develop new approximation algorithms for classical graph and set problems in the RAM model under space constraints. As one of our main results, we devise an algorithm for d–Hitting Set that runs in time nO(d2+(d/ε)), ...