BORA - UiB

Bergen Open Research Archive

Browsing Department of Informatics by Title

Bergen Open Research Archive

Browsing Department of Informatics by Title

Sort by: Order: Results:

  • Danielsen, Lars Eirik; Parker, Matthew G. (Peer reviewed; Journal article, Springer, 2010)
    We show that (n, 2n) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to undirected graphs. Graph representation ...
  • Bergmann, Ørjan (Master thesis, The University of Bergen, 2002)
  • Kats, Lennart C. L.; Kalleberg, Karl Trygve; Visser, Eelco (Journal article, Elsevier, 2010-09-17)
    Modern IDEs increase developer productivity by incorporating many different kinds of editor services. These can be purely syntactic, such as syntax highlighting, code folding, and an outline for navigation; or they can be ...
  • Riskedal, Espen (Master thesis, The University of Bergen, 2002)
    This thesis studies drumloops, and the possibility to separate the different drumsounds from each other. Drum onsets and the detection of these are thoroughly discussed. Different approaches for detection and separation ...
  • Tekle, Kidane Mebrahtu (Master thesis, The University of Bergen, 2008-11-18)
  • Bottu, Anil Kumar (Master thesis, The University of Bergen, 2008-11-18)
    Dynamic content manager for E-Learning project is developed as the partial fulfillment of master studies under the supervision of yngve lamo Ph.D and Khalid Azim Mughal Ph.D.
  • Sebak, Bjørn Christian (Master thesis, The University of Bergen, 2008-10-13)
    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 ...
  • Kaufmann, Roland (Master thesis, The University of Bergen, 2003)
  • Carlsen, Joachim Christoffer (Master thesis, 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 ...
  • Pobitzer, Armin; Tutkun, Murat; Anreassen, Øyvind; Fuchs, Raphael; Peikert, Ronald; Hauser, Helwig (Peer reviewed; Journal article, 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 ...
  • Pino Arevalo, Ana Gabriela (Master thesis, 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
  • Naydenova, Irina Petkova (Doctoral thesis, 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 ...
  • Fomin, Fedor V.; Todinca, Ioan; Kratsch, Dieter; Villanger, Yngve (Journal article, SIAM Journals, 2006)
  • Drange, Pål Grønås; Fomin, Fedor V.; Pilipczuk, Michal Pawel; Villanger, Yngve (Journal article, 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 ...
  • Goncearenco, Alexander; Berezovsky, Igor N. (Journal article, 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, ...
  • Gaspers, Serge (Doctoral thesis, 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 ...
  • Patel, Daniel (Doctoral thesis, 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 ...
  • Ganeshan, Vithya (Master thesis, 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. ...
  • Kejriwal, Anisha (Master thesis, 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 ...
  • Hovland, Dag (Doctoral thesis, The University of Bergen, 2010-12-16)

Search BORA


Browse

My Account