Now showing items 339-358 of 400

    • Støtte for Geodata i Dynamic Presentation Generator 

      Waage, Aleksander Vatle (The University of Bergen, 2012-01-27)
      Master thesis
    • Støtte for rike klienter i Dynamic Presentation Generator 

      Skeidsvoll, Peder Lång (The University of Bergen, 2010-06-01)
      Denne oppgaven beskriver hvordan det kan legges til støtte for rike klienter i Dynamic Presentation Generator (DPG). Oppgaven tar for seg både server og klientsiden av temaet. DPG er et innholdshåndteringssystem utviklet ...
      Master thesis
    • Subexponential Algorithms for Partial Cover Problems 

      Fomin, Fedor; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket (Dagstuhl Publishing, 2009)
      Partial Cover problems are optimization versions of fundamental and well studied problems like {\sc Vertex Cover} and {\sc Dominating Set}. Here one is interested in covering (or dominating) the maximum number of edges (or ...
      Conference object
    • Subexponential-time parameterized algorithm for Steiner tree on planar graphs 

      Pilipczuk, Marcin; Pilipczuk, Michal Pawel; van Leeuwen, Erik Jan; Sankowski, Piotr (Dagstuhl Publishing, 2013)
      The well-known bidimensionality theory provides a method for designing fast, subexponential-time parameterized algorithms for a vast number of NP-hard problems on sparse graph classes such as planar graphs, bounded genus ...
      Conference object
    • Substation Location in Offshore Wind Farms - A Planar Multi-Facility Location-Routing Problem 

      Amland, Thomas (The University of Bergen, 2014-03-14)
      In offshore wind farms, two important parts of the design are to determine locations for substations and a cabling layout that connects every turbine to a substation. These problems are interconnected, as the cable layout ...
      Master thesis
    • A Survey of Linear-Programming Guided Branching Parameterized Algorithms for Vertex Cover, with Experimental Results 

      Urhaug, Tobias Sørensen (The University of Bergen, 2015-06-01)
      A survey of FPT algorithms for Vertex Cover, parameterized by an above guarantee parameter.
      Master thesis
    • Systematic exploration of error sources in pyrosequencing flowgram data 

      Balzer, Susanne Mignon; Malde, Ketil; Jonassen, Inge (Oxford University Press, 2011)
      Motivation: 454 pyrosequencing, by Roche Diagnostics, has emerged as an alternative to Sanger sequencing when it comes to read lengths, performance and cost, but shows higher per-base error rates. Although there are ...
      Peer reviewedJournal article
    • Techniques in parameterized algorithm design 

      Sloper, Christian (The University of Bergen, 2006-03-06)
      In this thesis we give a novel classification of techniques for designing parameterized algorithms, together with research publications applying these techniques, in particular Crown Decompositions, to various problems. In ...
      Doctoral thesis
    • Testing with Concepts and Axioms in C++ 

      Bagge, Anya Helene; David, Valentin; Haveraaen, Magne (University of Bergen, Department of Informatics, 2008-10)
      Modern development practices encourage extensive testing of code while it is still under development, using unit tests to check individual code units in isolation. Such tests are typically case-based, checking a likely ...
      Research report
    • Throughput and robustness of bioinformatics pipelines for genome-scale data analysis 

      Sztromwasser, Paweł (The University of Bergen, 2014-02-19)
      The post-genomic era has been heavily influenced by the rapid development of highthroughput molecular-screening technologies, which has enabled genome-wide analysis approaches on an unprecedented scale. The constantly ...
      Doctoral thesis
    • Tight bounds for parameterized complexity of Cluster Editing 

      Fomin, Fedor; Kratsch, Stefan; Pilipczuk, Marcin; Pilipczuk, Michal Pawel; Villanger, Yngve (Dagstuhl Publishing, 2013)
      In the Correlation Clustering problem, also known as Cluster Editing, we are given an undirected graph G and a positive integer k; the task is to decide whether G can be transformed into a cluster graph, i.e., a disjoint ...
      Conference object
    • TMM@: a web application for the analysis of transmembrane helix mobility 

      Skjærven, Lars; Jonassen, Inge; Reuter, Nathalie (BioMed Central, 2007-07-02)
      Background: To understand the mechanism by which a protein transmits a signal through the cell membrane, an understanding of the flexibility of its transmembrane (TM) region is essential. Normal Mode Analysis (NMA) has ...
      Journal article
    • Tools and data services registry: a community effort to document bioinformatics resources 

      Ison, Jon; Rapacki, Kristoffer; Ménager, Hervé; Kalaš, Matúš; et al., 69 authors (Oxford University Press, 2015-11-03)
      Life sciences are yielding huge data sets that underpin scientific discoveries fundamental to improvement in human health, agriculture and the environment. In support of these discoveries, a plethora of databases ...
      Journal article
    • Tournaments and Optimality: New Results in Parameterized Complexity 

      Pilipczuk, Michal Pawel (The University of Bergen, 2013-11-22)
      Doctoral thesis
    • Towards a multilevel model transformation engine 

      Johnsen, Leif Arne Røyrøy (The University of Bergen, 2017)
      Domain specific modelling languages (DSML) are usually defined through fixed level meta modelling tools such as EMF. While this is sufficient for defining languages that has no overlap with other languages, the approach ...
      Master thesis
    • Towards a Secure Framework for mHealth. A Case Study in Mobile Data Collection Systems 

      Gejibo, Samson Hussien (The University of Bergen, 2015-11-05)
      The rapid growth in the mobile communications technology and wide cellular coverage created an opportunity to satisfy the demand for low-cost health care solutions. Mobile Health (a.k.a. mHealth) is a promising health ...
      Doctoral thesis
    • (Towards an) Implementation of a Graphical Editor for Diagrammatic Predicate Logic in the Eclipse Platform 

      Skjerveggen, Stian (The University of Bergen, 2008)
      The primary goal of this master's thesis is to explore how the Eclipse Platform can be beneficial for the Generic Diagrammatic Software Specification project, and how a graphical editor in the Eclipse Platform can be put ...
      Master thesis
    • Towards Correct Modelling and Model Transformation in DPF 

      Wang, Xiaoliang (The University of Bergen, 2016-06-14)
      Model-driven engineering (MDE) is a model-centric software development methodology. It promotes models as first-class entities in software de- velopment. Models are used to represent software along software devel- opment ...
      Doctoral thesis
    • Towards Efficient Algorithms in Algebraic Cryptanalysis 

      Schilling, Thorsten Ernst (The University of Bergen, 2012-08-09)
      Doctoral thesis
    • Towards Optimal Data Transmission by Network Coding 

      Ravanbakhsh, Mohammad (The University of Bergen, 2009-12-16)
      Communication protocols based on coded schemes and, in particular, network coding promise increased efficiency for future networks. The field is still young. Nevertheless, many important results have been already obtained. ...
      Doctoral thesis