Browsing Department of Informatics by Title
Now showing items 6988 of 259

Exploring Subexponential Parameterized Complexity of Completion Problems
(Schloss Dagstuhl  LeibnizZentrum fuer Informatik, 20140219)Let F be a family of graphs. In the FCompletion problem, we are given an nvertex graph G and an integer k as input, and asked whether at most k edges can be added to G so that the resulting graph does not contain a ... 
Exploring the evolution of protein function in Archaea
(BioMed Central, 20120530)Background: Despite recent progress in studies of the evolution of protein function, the questions what were the first functional protein domains and what were their basic building blocks remain unresolved. Previously, we ... 
Exponential time algorithms: Structures, measures, and bounds
(The University of Bergen, 20081205)This thesis studies exponential time algorithms, more precisely, algorithms exactly solving problems for which no polynomial time algorithm is known and likely to exist. Interested in worst–case upper bounds on the running ... 
Expressive Visualization and Rapid Interpretation of Seismic Volumes
(The University of Bergen, 20091027)One of the most important resources in the world today is energy. Oil and gas provide two thirds of the world energy consumption, making the world completely dependent on it. Locating and recovering the remaining oil and ... 
Fast Method for MaximumFlow Problem with MinimumLot Sizes
(The University of Bergen, 20150303)In transportation networks, such as pipeline networks for transporting natural gas, it is often impractical to send across amounts of flow below a certain threshold. Such lower threshold is referred as the minimumlot size. ... 
Fast methods to solve the pooling problem
(The University of Bergen, 20140531)In pipeline transportation of natural gas, simple network flow problems are replaced by hard ones when bounds on the flow quality are imposed. The sources, typically represented by gas wells, provide flow of unequal ... 
Feasible Algorithms for Semantics — Employing Automata and Inference Systems
(The University of Bergen, 20101216) 
Filtering duplicate reads from 454 pyrosequencing data
(Oxford University Press, 2013)Motivation: Throughout the recent years, 454 pyrosequencing has emerged as an efficient alternative to traditional Sanger sequencing and is widely used in both de novo wholegenome sequencing and metagenomics. Especially ... 
Filtering of FTLE for Visualizing Spatial Separation in Unsteady 3D Flow
(Springer, 2012)In many cases, feature detection for flow visualization is structured in two phases: first candidate identification, and then filtering. With this paper, we propose to use the directional information contained in the ... 
Finding k Disjoint Triangles in an Arbitrary Graph
(Springer Verlag, 2004) 
Finding Resource Bounds in the Presence of Explicit Deallocation
(Springer Berlin Heidelberg, 20051017)A software program requesting a resource that is not available usually raises an outofresource exception. Component software is software that has been assembled from standardized, reusable components which, in turn, may ... 
Floating Fault Analysis of Trivium
(Springer Berlin Heidelberg, 2008)One of the eSTREAM final portfolio ciphers is the hardwareoriented stream cipher Trivium. It is based on 3 nonlinear feedback shift registers with a linear output function. Although Trivium has attached a lot of interest, ... 
Formulas as programs
(2003)Alma0 is a programming language supporting declarative programming, which combines the advantages of imperative and logic programming paradigms. This work explores declarative programming by extending the interpretation ... 
FreeContact: fast and free software for protein contact prediction from residue coevolution
(BioMed Central, 20140326)Background: 20 years of improved technology and growing sequences now renders residueresidue contact constraints in large protein families through correlated mutations accurate enough to drive de novo predictions of protein ... 
Fusing a Transformation Language with an Open Compiler
(Elsevier, 20080401)Program transformation systems provide powerful analysis and transformation frameworks as well as concise languages for language processing, but instantiating them for every subject language is an arduous task, most often ... 
Generalized Bent and/or Negabent Constructions
(The University of Bergen, 20120427)In this thesis, we generalize the MaioranaMcFarland construction for bent, negabent and bentnegabent Boolean functions and describe a way to computationally search for constructions using these generalizations. We present ... 
Generating a synthetic diffusion tensor dataset
(IEEE, 2005)During the last years, many techniques for denoising, segmentation and fibertracking have been applied to diffusion tensor MR image data (DTI) from human and animal brains. However, evaluating such methods may be difficult ... 
Generating treelike graphs
(The University of Bergen, 20081118)Implementation of an algorithm that interactively generates kgraphs, a superclass of kbranches. 
A geometrybased generic predictor for catalytic and allosteric sites
(Oxford University Press, 2011)An important aspect of understanding protein allostery, and of artificial effector design, is the characterization and prediction of substrate and effectorbinding sites. To find binding sites in allosteric enzymes, many ...