Now showing items 538-557 of 643

    • 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 ...
    • 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 ...
    • 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, 2020)
      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; Journal article, 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 ...
    • 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 ...
    • Structural parameterizations of clique coloring 

      Jaffke, Lars; Lima, Paloma T.; Philip, Geevarghese (Journal article; Peer reviewed, 2020)
      A clique coloring of a graph is an assignment of colors to its vertices such that no maximal clique is monochromatic. We initiate the study of structural parameterizations of the Clique Coloring problem which asks whether ...
    • Structure of Polynomial-Time Approximation 

      Leeuwen, Erik Jan van; Leeuwen, Jan van (Peer reviewed; Journal article, 2011-10-14)
      Approximation schemes are commonly classified as being either a polynomial-time approximation scheme (ptas) or a fully polynomial-time approximation scheme (fptas). To properly differentiate between approximation schemes ...
    • Strukturering av data for internettbehandling av pasienter med depresjon 

      Bergheim, Jostein (Master thesis, 2018-08-21)
      Depresjon er et globalt voksende problem med store direkte og indirekte økonomiske belastninger. Internettbasert behandling som har vist seg å gi god effekt for enkelte kategorier av pasienter med depresjon. For et av ...
    • Støtte for Geodata i Dynamic Presentation Generator 

      Waage, Aleksander Vatle (Master thesis, 2012-01-27)
    • Støtte for rike klienter i Dynamic Presentation Generator 

      Skeidsvoll, Peder Lång (Master thesis, 2010-06-01)
      Denne oppgaven beskriver hvordan det kan legges til støtte for rike klienter i Dynamic Presentation Generator (DPG). Oppgaven tar for seg både server og klientsiden av temaet. DPG er et innholdshåndteringssystem utviklet ...
    • Subdivisions in digraphs of large out-degree or large dichromatic number 

      Aboulker, Pierre; Cohen, Nathann; Havet, Frederic; Lochet, William; Moura, Phablo F S; Thomasse, Stephan (Journal article; Peer reviewed, 2019)
      In 1985, Mader conjectured the existence of a function f such that every digraph with minimum out-degree at least f ( k ) contains a subdivision of the transitive tournament of order k . This conjecture is still completely ...
    • Subexponential Algorithms for Partial Cover Problems 

      Fomin, Fedor; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket (Conference object; Peer reviewed; Journal article, 2009)
      Partial Cover problems are optimization versions of fundamental and well studied problems like {\sc Vertex Cover} and {\sc Dominating Set}. Here one is interested in covering (or dominating) the maximum number of edges (or ...
    • Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs 

      Fomin, Fedor; Golovach, Petr (Journal article; Peer reviewed, 2020)
      We study algorithmic properties of the graph class Chordal-ke, that is, graphs that can be turned into a chordal graph by adding at most k edges or, equivalently, the class of graphs of fill-in at most k. We discover that ...