Now showing items 222-241 of 398

    • Naive and adapted utilization of the GPU for general purpose computing 

      Mjøs, Alexander (The University of Bergen, 2017)
      In this thesis we will see that adaptive utilization of the graphical processing unit (GPU) has much better performance than naive utilization, but it takes longer time to implement and requires more knowledge about ...
      Master thesis
    • Naturlige nettverk 

      Vatshelle, Martin (The University of Bergen, 2008)
      En innføring i naturlige nettverk. Vi forklarer og diskuterer begrepet naturlige nettverk og vurderer hvilke nettverk som bør kalles naturlige. Vi ser på forskjeller og likheter mellom tilfeldige, planlagte og naturlige ...
      Master thesis
    • Network coding in Bluetooth networks 

      Stenvoll, Roger (The University of Bergen, 2009-10-01)
      This thesis discusses the possibility to apply network coding to a Bluetooth piconet. A protocol is proposed. This protocol is based on using deterministic linear network coding. The proposed alphabet size is binary, and ...
      Master thesis
    • A New Generating Set Search Algorithm for Partially Separable Functions 

      Frimannslund, Lennart; Steihaug, Trond (IARIA, 2010)
      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 ...
      Peer reviewedConference object
    • New Lower Bounds on the Maximum Number of Minimal Connected Vertex Covers 

      Ryland, Ida (The University of Bergen, 2017-06-20)
      Graphs are important mathematical structures that are used to model many real-life problems. They can, for instance, be used to model relations between objects in a network. An important field of study in graph theory is ...
      Master thesis
    • New Results on Minimal Triangulations 

      Villanger, Yngve (The University of Bergen, 2006-04-25)
      Doctoral thesis
    • New Width Parameters of Graphs 

      Vatshelle, Martin (The University of Bergen, 2012-09-03)
      The main focus of this thesis is on using the divide and conquer technique to efficiently solve graph problems that are in general intractable. We work in the field of parameterized algorithms, using width parameters of ...
      Doctoral thesis
    • Non-Constructivity in Kan Simplicial Sets 

      Bezem, Marc; Coquand, Thierry; Parmann, Erik (Dagstuhl Publishing, 2015)
      We give an analysis of the non-constructivity of the following basic result: if X and Y are simplicial sets and Y has the Kan extension property, then Y X also has the Kan extension property. By means of Kripke countermodels ...
      Conference object
    • Nonlinear feedback shift registers and generating of binary de Bruijn sequences 

      Vivelid, Christian Ebne (The University of Bergen, 2016-11-21)
      Master thesis
    • A Note on Exact Algorithms for Vertex Ordering Problems on Graphs 

      Bodlaender, Hans L.; Fomin, Fedor; Koster, Arie M.C.A.; Kratsch, Dieter; Thilikos, Dimitrios M. (Springer, 2011-01-21)
      In this note, we give a proof that several vertex ordering problems can be solved in O ∗(2 n ) time and O ∗(2 n ) space, or in O ∗(4 n ) time and polynomial space. The algorithms generalize algorithms for the Travelling ...
      Peer reviewedJournal article
    • Novice Difficulties with Language Constructs 

      Rosbach, Alexander Hoem (The University of Bergen, 2013-08-01)
      Programming is a difficult skill to learn, and programming courses have high dropout rates. In this thesis we study the problems that students have during their first introductory programming course at The University ...
      Master thesis
    • Nye øvre skranker på ytelsen til adaptiv koding og modulasjon i OFDM-ba serte trådløse nettverk 

      Bjørstad, Trond Rognebakke (The University of Bergen, 2004)
      Master thesis
    • Obscurance-based Volume Rendering Framework 

      Ruiz, Marc; Boada, Imma; Viola, Ivan; Bruckner, Stefan; Feixas, Miquel; Sbert, Mateu (The Eurographics Association, 2008)
      lighting effects in a faster way than global illumination. Its application in volume visualization is of special interest since it permits us to generate a high quality rendering at a low cost. In this paper, we propose ...
      Peer reviewedConference object
    • OLS Dialog: An open-source front end to the Ontology Lookup Service 

      Barsnes, Harald; Côté, Richard G.; Eidhammer, Ingvar; Martens, Lennart (BioMed Central, 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. ...
      Journal articlePeer reviewed
    • On a New Method for Derivative Free Optimization 

      Frimannslund, Lennart; Steihaug, Trond (IARIA, 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 ...
      Journal article
    • On Classification and Some Properties of APN Functions 

      Sun, Bo (The University of Bergen, 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 ...
      Doctoral thesis
    • On Connections Between Graphs, Codes, Quantum States, and Boolean Functions 

      Danielsen, Lars Eirik (The University of Bergen, 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 ...
      Doctoral thesis
    • On Curvature and Separability in Unconstrained Optimisation 

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

      Cygan, Marek; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michal Pawel; Saurabh, Saket (Springer, 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 ...
      Journal article
    • On iterative decoding of high-density parity-check codes using edge-local complementation 

      Knudsen, Joakim Grahl (The University of Bergen, 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 ...
      Doctoral thesis