Now showing items 69-88 of 268

  • Exact algorithms for treewidth and minimum fill-in 

    Fomin, Fedor V.; Todinca, Ioan; Kratsch, Dieter; Villanger, Yngve (SIAM Journals, 2006)
  • Exploring Subexponential Parameterized Complexity of Completion Problems 

    Drange, Pål Grønås; Fomin, Fedor V.; Pilipczuk, Michal Pawel; Villanger, Yngve (Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014-02-19)
    Let F be a family of graphs. In the F-Completion problem, we are given an n-vertex 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 

    Goncearenco, Alexander; Berezovsky, Igor N. (BioMed Central, 2012-05-30)
    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 

    Gaspers, Serge (The University of Bergen, 2008-12-05)
    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 

    Patel, Daniel (The University of Bergen, 2009-10-27)
    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 Maximum-Flow Problem with Minimum-Lot Sizes 

    Ganeshan, Vithya (The University of Bergen, 2015-03-03)
    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 minimum-lot size. ...
  • Fast methods to solve the pooling problem 

    Kejriwal, Anisha (The University of Bergen, 2014-05-31)
    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 

    Hovland, Dag (The University of Bergen, 2010-12-16)
  • Filtering duplicate reads from 454 pyrosequencing data 

    Balzer, Susanne Mignon; Malde, Ketil; Grohme, Markus A.; Jonassen, Inge (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 whole-genome sequencing and metagenomics. Especially ...
  • Filtering of FTLE for Visualizing Spatial Separation in Unsteady 3D Flow 

    Pobitzer, Armin; Peikert, Ronald; Fuchs, Raphael; Theisel, Holger; Hauser, Helwig (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 

    Fellows, Mike; Heggernes, Pinar; Rosamond, Frances; Sloper, Christian; Telle, Jan Arne (Springer Verlag, 2004)
  • Finding Resource Bounds in the Presence of Explicit Deallocation 

    Truong, Anh Hoang; Bezem, Marcus A. (Springer Berlin Heidelberg, 2005-10-17)
    A software program requesting a resource that is not available usually raises an out-of-resource exception. Component software is software that has been assembled from standardized, reusable components which, in turn, may ...
  • Fixed Parameter Set Splitting, Linear Kernel and Improved Running Time 

    Lokshtanov, Daniel; Sloper, Christian (2005)
  • Floating Fault Analysis of Trivium 

    Hojsík, Michal; Rudolf, Bohuslav (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 

    Burrows, Eva (2003)
    Alma-0 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 co-evolution 

    Kaján, László; Hopf, Thomas A.; Kalaš, Matúš; Marks, Debora S.; Rost, Burkhard (BioMed Central, 2014-03-26)
    Background: 20 years of improved technology and growing sequences now renders residue-residue 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 

    Kalleberg, Karl Trygve; Visser, Eelco (Elsevier, 2008-04-01)
    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 

    Ådlandsvik, Yngve (The University of Bergen, 2012-04-27)
    In this thesis, we generalize the Maiorana-McFarland construction for bent, negabent and bent-negabent Boolean functions and describe a way to computationally search for constructions using these generalizations. We present ...
  • Generating a synthetic diffusion tensor dataset 

    Bergmann, Ørjan; Lundervold, Arvid; Steihaug, Trond (IEEE, 2005)
    During the last years, many techniques for de-noising, segmentation and fiber-tracking have been applied to diffusion tensor MR image data (DTI) from human and animal brains. However, evaluating such methods may be difficult ...
  • Generating tree-like graphs 

    Moldeklev, Elisabeth (The University of Bergen, 2008-11-18)
    Implementation of an algorithm that interactively generates k-graphs, a superclass of k-branches.