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

Dynamic Presentation Generator 2.0 Utvikling av ny dynamisk presentasjonsgenerator og presentasjonsmønsterspesifikasjon.
(The University of Bergen, 20081013)Denne masteroppgaven er en del av JAva FjernUndervisningsprosjektet (JAFU) på Institutt for Informatikk ved Universitetet i Bergen. Formålet med dette prosjektet er først og fremst å kunne tilby nettbasert undervisning ... 
Efficiently Locating Schema Incompatibilities in an eXtensible Markup Language
(The University of Bergen, 2003) 
Elastic Grid Resources using Cloud Technologies
(The University of Bergen, 20140602)A Large Ion Collider Experiment (ALICE) is one of four experiments at the Large Hadron Collider (LHC) at CERN. The detectors in the ALICE experiment produce data at a rate of 4 GB/s after being filtered and compressed ... 
En studie av meshtraverseringsmønstre for Sophusbiblioteket og kjøretids variasjoner på SGI Origin
(The University of Bergen, 2002) 
En visuell tilnærming til simulering av købaserte modeller i Java
(The University of Bergen, 2004) 
Energyscale Aware Feature Extraction for Flow Visualization
(Blackwell Publishing Ltd., 2011)In the visualization of flow simulation data, feature detectors often tend to result in overly rich response, making some sort of filtering or simplification necessary to convey meaningful images. In this paper we present ... 
Enhancing Content Management in DPG
(The University of Bergen, 20131120)This thesis analyzes the usability aspects of PCE and implements a new Single Page Application that attempts to solve this issues 
Error Detection and Correction for Symmetric and Asymmetric Channels
(The University of Bergen, 20070827)When a message is sent over a channel errors can occur due to noise during the transmission. So it is very important to know the error correction and detection capability of the code, which is used to encode the ... 
Exact algorithms for MAX2SAT and MAX3SAT via multidimensional matrix multiplication
(The University of Bergen, 20150601)In this thesis it is showed how an $O(n^{4\epsilon})$ algorithm for the cube multiplication problem (that is defined in the thesis) would imply a faster than naive $O^{*}(2^{n(1\frac{\epsilon}{4})})$ algorithm for the ... 
Exact algorithms for treewidth and minimum fillin
(SIAM Journals, 2006) 
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)