• Solving the 2-disjoint connected subgraphs problem faster than 2ⁿ 

      Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michal Pawel; Wojtaszczyk, Jakub Onufry (Peer reviewed; Journal article, 2014-10)
      The 2-DISJOINT CONNECTED SUBGRAPHS problem, given a graph along with two disjoint sets of terminals Z1,Z2, asks whether it is possible to find disjoint sets A1,A2, such that Z1 ⊆ A1, Z2 ⊆ A2 and A1,A2 induce connected ...
    • Solving the pooling problem with LMI relaxations 

      Frimannslund, Lennart; El Ghami, Mohamed; Alfaki, Mohammed; Haugland, Dag (Chapter; Peer reviewed, 2012)
      We consider the standard pooling problem with a single quality parameter, which is a polynomial global optimization problem occurring among other places in the oil industry. In this paper, we show that if the feasible set ...
    • Some group-theoretical results on Feistel Networks in a long-key scenario 

      Aragona, Riccardo; Calderini, Marco; Civino, Roberto (Journal article; Peer reviewed, 2020)
      The study of the trapdoors that can be hidden in a block cipher is and has always been a high-interest topic in symmetric cryptography. In this paper we focus on Feistel-network-like ciphers in a classical long-key scenario ...
    • Some properties of K-convex mappings in variable ordering settings 

      Rückmann, Jan-Joachim; Hernandez Escobar, Daniel; Bouza Allende, Gemayqzel (Journal article; Peer reviewed, 2022)
      We consider a generalization of standard vector optimization which is called vector optimization with variable ordering structures. The problem class under consideration is characterized by a point-dependent proper cone-valued ...
    • Sparse Boolean equations and circuit lattices 

      Semaev, Igor (Peer reviewed; Journal article, 2010)
      A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard problem in the cryptanalysis of modern ciphers. In ...
    • Sparse Nerves in Practice 

      Blaser, Nello; Brun, Morten (Peer reviewed; Journal article, 2019)
      Topological data analysis combines machine learning with methods from algebraic topology. Persistent homology, a method to characterize topological features occurring in data at multiple scales is of particular interest. ...
    • Speaker recognition implemented as part of a video-editing system 

      Tveita, Sebastian Rojas (Master thesis, 2019-06-29)
      With machine learning rising to prominence over the last decades, a lot of companies are doing research on how it can be applied in their products or production. Some of these companies have used machine learning with a ...
    • Specificity of Loxosceles α clade phospholipase D enzymes for choline-containing lipids: Role of a conserved aromatic cage 

      Moutoussamy, Emmanuel Edouard; Waheed, Qaiser; Binford, Greta J.; Khan, Hanif Muhammad; Moran, Shane M.; Eitel, Anna R.; Cordes, Matthew H.J.; Reuter, Nathalie (Journal article; Peer reviewed, 2022)
      Spider venom GDPD-like phospholipases D (SicTox) have been identified to be one of the major toxins in recluse spider venom. They are divided into two major clades: the α clade and the β clade. Most α clade toxins present ...
    • Specifying with syntactic theory functors 

      Haveraaen, Magne; Roggenbach, Marcus (Journal article; Peer reviewed, 2020)
      We propose a framework, syntactic theory functors (STFs), for creating syntactic structuring mechanisms for specification languages. Good support for common reuse patterns is important for systematically developing ...
    • Speech-to-text models to transcribe emergency calls 

      Thuestad, Jens Andreas; Grutle, Øyvind (Master thesis, 2023-06-01)
      This thesis is part of the larger project “AI-Support in Medical Emergency Calls (AISMEC)”, which aims to develop a decision support system for Emergency Medical Communication Center (EMCC) operators to better identify and ...
    • Spiking Neural Networks for Pattern Recognition 

      Vestbøstad, Ketil Yddal (Master thesis, 2017)
      We have investigated an existing theoretical model for spiking neural networks, and based on this model we have implemented our own network. Then we have carried out experiments with this network, and compared its performance ...
    • SplitStreams: A Visual Metaphor for Evolving Hierarchies 

      Bolte, Fabian; Nourani, Mahsan; Ragan, Eric; Bruckner, Stefan (Peer reviewed; Journal article, 2021)
      The visualization of hierarchically structured data over time is an ongoing challenge and several approaches exist trying to solve it. Techniques such as animated or juxtaposed tree visualizations are not capable of providing ...
    • The State of the Art in Topology-based Visualization of Unsteady Flow 

      Pobitzer, Armin; Peikert, Ronald; Fuchs, Raphael; Schindler, Benjamin; Kuhn, Alexander; Theisel, Holger; Matković, Krešimir; Hauser, Helwig (Peer reviewed; Journal article, 2011)
      Vector fields are a common concept for the representation of many different kinds of flow phenomena in science and engineering. Methods based on vector field topology are known for their convenience for visualizing and ...
    • Statistical and Algebraic Properties of DES 

      Fauskanger, Stian; Semaev, Igor A. (Lecture Notes in Computer Science ; 9589, Chapter, 2016)
      D. Davies and S. Murphy found that there are at most 660 different probability distributions on the output from any three adjacent S-boxes after 16 rounds of DES. In this paper it is shown that there are only 72 different ...
    • Statistical considerations for the design and interpretation of proteomics experiments 

      Burger, Bram (Doctoral thesis, 2021-06-10)
      The methods to study proteins are continuously improving, making it possible to identify and study increasingly more proteins. It is important to keep studying and improving the way experiments are designed, performed, and ...
    • A Statistics-based Dimension Reduction of the Space of Path Line Attributes for Interactive Visual Flow Analysis 

      Pobitzer, Armin; Lež, Alan; Matković, Krešimir; Hauser, Helwig (Peer reviewed; Journal article, 2012)
      Recent work has shown the great potential of interactive flow analysis by the analysis of path lines. The choice of suitable attributes, describing the path lines, is, however, still an open question. This paper addresses ...
    • A Story of Computational Science: Colonel Titus’ Problem from the 17th Century 

      Steihaug, Trond (Journal article, 2022-06-14)
      Experimentation and the evaluation of algorithms have a long history in algebra. In this paper we follow a single test example over more than 250 years. In 1685, John Wallis published A treatise of algebra, both historical ...
    • Straggler-Resilient Distributed Computing 

      Severinson, Lars Albin (Doctoral thesis, 2022-09-09)
      Utbredelsen av distribuerte datasystemer har økt betydelig de siste årene. Dette skyldes først og fremst at behovet for beregningskraft øker raskere enn hastigheten til en enkelt datamaskin, slik at vi må bruke flere ...
    • Strategic optimization of offshore wind farm installation 

      Backe, Stian; Haugland, Dag (Lecture Notes in Computer Science, Chapter; Peer reviewed; Journal article, 2017)
      This work describes logistical planning of offshore wind farm (OWF) installation through linear programming. A mixed integer linear programming (MILP) model is developed to analyze cost-effective port and vessel strategies ...
    • Strongly stable C-stationary points for mathematical programs with complementarity constraints 

      Escobar, Daniel Hernandez; Rückmann, Jan-Joachim (Journal article; Peer reviewed, 2021)
      In this paper we consider the class of mathematical programs with complementarity constraints (MPCC). Under an appropriate constraint qualification of Mangasarian–Fromovitz type we present a topological and an equivalent ...