Browsing Department of Informatics by Title
Now showing items 203222 of 366

Naturlige nettverk
(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
(The University of Bergen, 20091001)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
(IARIA, 2010)A new derivativefree 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
(The University of Bergen, 20170620)Graphs are important mathematical structures that are used to model many reallife 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 Width Parameters of Graphs
(The University of Bergen, 20120903)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 
NonConstructivity in Kan Simplicial Sets
(Dagstuhl Publishing, 2015)We give an analysis of the nonconstructivity 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
(The University of Bergen, 20161121)Master thesis 
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs
(Springer, 20110121)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
(The University of Bergen, 20130801)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 OFDMba serte trådløse nettverk
(The University of Bergen, 2004)Master thesis 
Obscurancebased Volume Rendering Framework
(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 opensource front end to the Ontology Lookup Service
(BioMed Central, 20100117)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
(IARIA, 2011)A new derivativefree 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 Connections Between Graphs, Codes, Quantum States, and Boolean Functions
(The University of Bergen, 20080528)We study objects that can be represented as graphs, errorcorrecting codes, quantum states, or Boolean functions. It is known that selfdual additive codes, which can also be interpreted as quantum states, can be ...Doctoral thesis 
On Curvature and Separability in Unconstrained Optimisation
(The University of Bergen, 20060616)Doctoral thesis 
On cutwidth parameterized by vertex cover
(Springer, 201404)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 highdensity paritycheck codes using edgelocal complementation
(The University of Bergen, 20101124)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 wellsuited for ...Doctoral thesis 
On SelfDual Quantum Codes, Graphs, and Boolean Functions
(The University of Bergen, 2005)A short introduction to quantum error correction is given, and it is shown that zerodimensional quantum codes can be represented as selfdual additive codes over GF(4) and also as graphs. We show that graphs representing ...Master thesis 
On Stable Marriages and Greedy Matchings
(SIAM, 2016)Research on stable marriage problems has a long and mathematically rigorous history, while that of exploiting greedy matchings in combinatorial scientific computing is a younger and less developed research field. We consider ...Conference object