Now showing items 76-95 of 323

    • Efforts towards accessible and reliable bioinformatics 

      Kalaš, Matúš (The University of Bergen, 2015-11-19)
      The aim of the presented work was contributing to making scientific computing more accessible, reliable, and thus more efficient for researchers, primarily computational biologists and molecular biologists. Many approaches ...
      Doctoral thesis
    • Elastic Grid Resources using Cloud Technologies 

      Carlsen, Joachim Christoffer (The University of Bergen, 2014-06-02)
      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 ...
      Master thesis
    • The EMBRACE web service collection 

      Pettifer, Steve; Ison, Jon; Kalaš, Matúš; Thorne, David; McDermott, Philip; Jonassen, Inge; Ali, Liaquat; Fernandez, Jose M; Rodriguez, Jose M; Pisano, David G; Blanchet, Christophe; Uludag, Mahmut; Rice, Peter; Bartaseviciute, Edita; Rapacki, Kristoffer; Hekkelman, Maarten; Sand, Olivier; Stockinger, Heinz; Clegg, Andrew B; Bongcam-Rudloff, Eric; Salzemann, Jean; Breton, Vincent; Attwood, Teresa K; Cameron, Graham; Vriend, Gert (Oxford University Press (OUP), 2010-05-10)
      The EMBRACE (European Model for Bioinformatics Research and Community Education) web service collection is the culmination of a 5-year project that set out to investigate issues involved in developing and deploying web ...
      Journal article
    • En studie av mesh-traverseringsmønstre for Sophus-biblioteket og kjøretids variasjoner på SGI Origin 

      Hundvebakke, Hogne (The University of Bergen, 2002)
      Master thesis
    • En visuell tilnærming til simulering av købaserte modeller i Java 

      Ervik, Morten Johannes (The University of Bergen, 2004)
      Master thesis
    • Energy-scale Aware Feature Extraction for Flow Visualization 

      Pobitzer, Armin; Tutkun, Murat; Anreassen, Øyvind; Fuchs, Raphael; Peikert, Ronald; Hauser, Helwig (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 ...
      Peer reviewedJournal article
    • Enhancing Content Management in DPG 

      Pino Arevalo, Ana Gabriela (The University of Bergen, 2013-11-20)
      This thesis analyzes the usability aspects of PCE and implements a new Single Page Application that attempts to solve this issues
      Master thesis
    • Enumerating minimal connected dominating sets in graphs of bounded chordality 

      Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter (Dagstuhl Publishing, 2015)
      Listing, generating or enumerating objects of specified type is one of the principal tasks in algorithmics. In graph algorithms one often enumerates vertex subsets satisfying a certain property. We study the enumeration ...
      Conference object
    • Error Detection and Correction for Symmetric and Asymmetric Channels 

      Naydenova, Irina Petkova (The University of Bergen, 2007-08-27)
      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 ...
      Doctoral thesis
    • Exact algorithms for MAX-2SAT and MAX-3SAT via multidimensional matrix multiplication 

      Petkevich, Yevgheni (The University of Bergen, 2015-06-01)
      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 ...
      Master thesis
    • Exact algorithms for treewidth and minimum fill-in 

      Fomin, Fedor V.; Todinca, Ioan; Kratsch, Dieter; Villanger, Yngve (SIAM Journals, 2006)
      Journal article
    • 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 ...
      Journal article
    • 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 ...
      Journal article
    • 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 ...
      Doctoral thesis
    • 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 ...
      Doctoral thesis
    • 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
    • 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