Browsing Department of Informatics by Title
Now showing items 163182 of 277

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 the Classification of Hermitian SelfDual Additive Codes over GF(9)
(Institute of Electrical and Electronics Engineers, 201208)Additive codes over GF(9) that are selfdual with respect to the Hermitian trace inner product have a natural application in quantum information theory, where they correspond to ternary quantum errorcorrecting codes. ...Peer reviewedJournal article 
On the feasibility of distributed systems for interactive visual analysis of omics data
(The University of Bergen, 20140602)The purpose of this thesis is to discuss the feasibility of developing a distributed interactive visual analysis omics system demonstrating how selected modules from the standalone JExpress Modularized application ...Master thesis 
On the Privacy of Two Tag Ownership Transfer Protocols for RFIDs
(The author, 2012)In this paper, the privacy of two recent RFID tag ownership transfer protocols are investigated against the tag owners as adversaries. The first protocol called ROTIV is a scheme which provides a privacypreserving ...Conference object 
On the Security of NonLinear HB (NLHB) Protocol Against Passive Attack
(The author, 2012)As a variant of the HB authentication protocol for RFID systems, which relies on the complexity of decoding linear codes against passive attacks, Madhavan et al. presented NonLinear HB(NLHB) protocol. In contrast to ...Conference object 
Optimal preparation of graph states
(American Physical Society, 20110412)We show how to prepare any graph state of up to 12 qubits with: (a) the minimum number of controlledZ gates, and (b) the minimum preparation depth. We assume only onequbit and controlledZ gates. The method exploits ...Peer reviewedJournal article 
Optimal ternary cyclic codes with minimum distance four and five
(Elsevier, 201411)Cyclic codes are an important subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics. In this paper, two families of optimal ternary cyclic codes are ...Journal article 
Optimization issues in medical imaging and fibertracking
(The University of Bergen, 20080227)Fiber tracking is a relatively recent methodology, made possible by access to new highly advanced MR scanners able to produce highquality diffusion tensor images (DTI), which promises clinicians a possibility to observe ...Doctoral thesis 
Optimization Models for Turbine Location in Wind Farms
(The University of Bergen, 20120524)The topic of this thesis is wind farm optimization. The goal is to be able to decide where to install wind turbines within a given region in order to maximize the power output in two different scenarios: For a fixed number ...Master thesis 
Parallel Graph Algorithms for Combinatorial Scientific Computing
(The University of Bergen, 20110826)Doctoral thesis 
Parameterized complexity of Eulerian deletion problems
(Springer, 201401)We study a family of problems where the goal is to make a graph Eulerian, i.e., connected and with all the vertices having even degrees, by a minimum number of deletions. We completely classify the parameterized complexity ...Journal article 
Parameterized Graph Modification Algorithms
(The University of Bergen, 20151210)Graph modification problems form an important class of algorithmic problems in computer science. In this thesis, we study edge modification problems towards classes related to chordal graphs, with the main focus on trivially ...Doctoral thesis 
Parsing in a Broad Sense
(Springer, 2014)Having multiple representations of the same instance is common in software language engineering: models can be visualised as graphs, edited as text, serialised as XML. When mappings between such representations are considered, ...Chapter