• Obscurance-based Volume Rendering Framework 

      Ruiz, Marc; Boada, Imma; Viola, Ivan; Bruckner, Stefan; Feixas, Miquel; Sbert, Mateu (Chapter; Peer reviewed, 2008)
      Obscurances, from which ambient occlusion is a particular case, is a technology that produces natural-looking lighting effects in a faster way than global illumination. Its application in volume visualization is of special ...
    • OLS Dialog: An open-source front end to the Ontology Lookup Service 

      Barsnes, Harald; Côté, Richard G.; Eidhammer, Ingvar; Martens, Lennart (Peer reviewed; Journal article, 2010-01-17)
      Background: With the growing amount of biomedical data available in public databases it has become increasingly important to annotate data in a consistent way in order to allow easy access to this rich source of information. ...
    • On a New Method for Derivative Free Optimization 

      Frimannslund, Lennart; Steihaug, Trond (Peer reviewed; Journal article, 2011)
      A new derivative-free optimization method for unconstrained optimization of partially separable functions is presented. Using average curvature information computed from sampled function values the method generates an ...
    • On a New, Efficient Framework for Falsifiable Non-interactive Zero-Knowledge Arguments 

      Parisella, Roberto (Doctoral thesis, 2023-06-09)
      Et kunnskapsløst bevis er en protokoll mellom en bevisfører og en attestant. Bevisføreren har som mål å overbevise attestanten om at visse utsagn er korrekte, som besittelse av kortnummeret til et gyldig kredittkort, uten ...
    • On Classification and Some Properties of APN Functions 

      Sun, Bo (Doctoral thesis, 2018-06-22)
      Boolean functions optimal with respect to different cryptographic properties (such as APN, AB, bent functions, etc.) are crucial to the design of secure cryptosystems. Investigating the properties and construction of these ...
    • On Connections Between Graphs, Codes, Quantum States, and Boolean Functions 

      Danielsen, Lars Eirik (Doctoral thesis, 2008-05-28)
      We study objects that can be represented as graphs, error-correcting codes, quantum states, or Boolean functions. It is known that self-dual additive codes, which can also be interpreted as quantum states, can be represented ...
    • On construction and (non)existence of c-(almost) perfect nonlinear functions 

      Bartoli, Daniele; Calderini, Marco (Journal article; Peer reviewed, 2021)
      Functions with low differential uniformity have relevant applications in cryptography. Recently, functions with low c-differential uniformity attracted lots of attention. In particular, so-called APcN and PcN functions ...
    • On Curvature and Separability in Unconstrained Optimisation 

      Frimannslund, Lennart (Doctoral thesis, 2006-06-16)
    • On cutwidth parameterized by vertex cover 

      Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michal Pawel; Saurabh, Saket (Peer reviewed; Journal article, 2014-04)
      We study the CUTWIDTH problem, where the input is a graph G, and the objective is find a linear layout of the vertices that minimizes the maximum number of edges intersected by any vertical line inserted between two ...
    • On Dasgupta’s Hierarchical Clustering Objective and Its Relation to Other Graph Parameters 

      Høgemo, Svein; Bergougnoux, Benjamin; Brandes, Ulrik; Paul, Christophe; Telle, Jan Arne (Journal article; Peer reviewed, 2021)
      The minimum height of vertex and edge partition trees are well-studied graph parameters known as, for instance, vertex and edge ranking number. While they are NP-hard to determine in general, linear-time algorithms exist ...
    • On decoding additive generalized twisted Gabidulin codes 

      Kadir, Wrya; Li, Chunlei (Journal article; Peer reviewed, 2020)
      In this paper, we consider an interpolation-based decoding algorithm for a large family of maximum rank distance codes, known as the additive generalized twisted Gabidulin codes, over the finite field Fqn for any prime ...
    • On equivalence between known families of quadratic APN functions 

      Budaghyan, Lilya; Calderini, Marco; Villa, Irene (Journal article; Peer reviewed, 2020)
      This paper is dedicated to a question whether the currently known families of quadratic APN polynomials are pairwise different up to CCZ-equivalence. We reduce the list of these families to those CCZ-inequivalent to each ...
    • On generalized algebraic theories and categories with families 

      Bezem, Marc; Coquand, Thierry; Dybjer, Peter; Escardo, Martin (Journal article; Peer reviewed, 2021)
      We give a syntax independent formulation of finitely presented generalized algebraic theories as initial objects in categories of categories with families (cwfs) with extra structure. To this end, we simultaneously define ...
    • On interpolation-based decoding of a class of maximum rank distance codes 

      Kadir, Wrya Karim Kadir; Li, Chunlei; Zullo, Ferdinando (Journal article; Peer reviewed, 2021)
      In this paper we present an interpolation-based decoding algorithm to decode a family of maximum rank distance codes proposed recently by Trombetti and Zhou. We employ the properties of the Dickson matrix associated with ...
    • On Isotopic Shift Construction for Planar Functions 

      Budaghyan, Lilya; Calderini, Marco; Carlet, Claude; Coulter, Robert; Villa, Irene (Chapter; Peer reviewed, 2019)
      CCZ-equivalence is the most general currently known equivalence relation for functions over finite fields preserving planarity and APN properties. However, for the particular case of quadratic planar functions isotopic ...
    • On iterative decoding of high-density parity-check codes using edge-local complementation 

      Knudsen, Joakim Grahl (Doctoral thesis, 2010-11-24)
      The overall topic of this work is a graph operation known as edgelocal complementation (ELC) and its applications to iterative decoding of classical codes. Although these legacy codes are arguably not well-suited for ...
    • On KDE-based brushing in scatterplots and how it compares to CNN-based brushing 

      Fan, Chaoran; Hauser, Helwig (Chapter, 2019)
      In this paper, we investigate to which degree the human should be involved into the model design and how good the empirical model can be with more careful design. To find out, we extended our previously published Mahalanobis ...
    • On Neural Associative Memory Structures: Storage and Retrieval of Sequences in a Chain of Tournaments 

      Abolpour Mofrad, Asieh; Abolpour Mofrad, Samaneh; Yazidi, Anis; Parker, Matthew Geoffrey (Journal article; Peer reviewed, 2021)
      Associative memories enjoy many interesting properties in terms of error correction capabilities, robustness to noise, storage capacity, and retrieval performance, and their usage spans over a large set of applications. ...
    • On offshore wind farm maintenance scheduling for decision support on vessel fleet composition 

      Gutierrez-Alcoba, Alejandro; Hendrix, Eligius M.T.; Lopez, Gloria Ortega; Halvorsen-Weare, Elin Espeland; Haugland, Dag (Peer reviewed; Journal article, 2019)
      Maintenance costs account for a large part of the total cost of an offshore wind farm. Several models have been presented in the literature to optimize the fleet composition of the required vessels to support maintenance ...
    • On Perturbation Resilience of Non-uniform k-Center 

      Bandyapadhyay, Sayan (Journal article; Peer reviewed, 2021)
      The Non-Uniform k-center (NUkC) problem has recently been formulated by Chakrabarty et al. [ICALP, 2016; ACM Trans Algorithms 16(4):46:1–46:19, 2020] as a generalization of the classical k-center clustering problem. In ...