Now showing items 99-118 of 366

    • Fast biclustering by dual parameterization 

      Drange, Pål Grønås; Reidl, Felix; Villaamil, Fernando Sánchez; Sikdar, Somnath (Dagstuhl Publishing, 2015)
      We study two clustering problems, Starforest Editing, the problem of adding and deleting edges to obtain a disjoint union of stars, and the generalization Bicluster Editing. We show that, in addition to being NP-hard, none ...
      Conference object
    • 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. ...
      Master thesis
    • 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 ...
      Master thesis
    • Faster enumeration of minimal connected dominating sets in split graphs 

      Skjørten, Ida Bredal (The University of Bergen, 2017-06-20)
      Graphs are mathematical objects that can be used to model many real world problems. An example is a roadmap, where the nodes in the graph represent cities and the edges of the graph represent roads. An interesting and ...
      Master thesis
    • Feasible Algorithms for Semantics — Employing Automata and Inference Systems 

      Hovland, Dag (The University of Bergen, 2010-12-16)
      Doctoral thesis
    • 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 ...
      Peer reviewedJournal article
    • 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 ...
      Peer reviewedJournal article
    • Finding even subgraphs even faster 

      Goyal, Prachi; Misra, Pranabendu; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket (Dagstuhl Publishing, 2015)
      Problems of the following kind have been the focus of much recent research in the realm of parameterized complexity: Given an input graph (digraph) on n vertices and a positive integer parameter k, find if there exist k ...
      Conference object
    • Finding Induced Subgraphs via Minimal Triangulations 

      Fomin, Fedor; Villanger, Yngve (Dagstuhl Publishing, 2010)
      Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems in- cluding Minimum Fill-in and Treewidth. We discover unexpected ...
      Conference object
    • Finding k Disjoint Triangles in an Arbitrary Graph 

      Fellows, Mike; Heggernes, Pinar; Rosamond, Frances; Sloper, Christian; Telle, Jan Arne (Springer Verlag, 2004)
      Conference object
    • 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 ...
      Journal article
    • Firewalls: Enforcement of Security Policy in networks 

      Nordås, Harald (The University of Bergen, 2014-11-20)
      Firewalls are set up to protect computer networks. Originally, networks were just coupled together, in order to achieve connection. With the ability to reach networks all over the world, one started to denote this the ...
      Master thesis
    • 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, ...
      ChapterPeer reviewed
    • 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 ...
      Master thesis
    • 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 ...
      Journal article
    • 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 ...
      Journal article
    • 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 ...
      Journal article
    • 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 ...
      Master thesis
    • 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 ...
      Peer reviewedJournal article