Now showing items 1-20 of 277

    • Parameterized Graph Modification Algorithms 

      Drange, Pål Grønås (The University of Bergen, 2015-12-10)
      Graph modification problems form an important class of algorithmic problems in computer science. In this thesis, we study edge modification problems towards classes related to chordal graphs, with the main focus on trivially ...
      Doctoral thesis
    • Independent Set on P5-free graphs, an empirical study 

      Haug, Håvard Karim (The University of Bergen, 2015-11-20)
      We implement the recent polynomial time algorithm for the independent set problem on P5-free graphs, and study the performance of this algorithm on graphs of size up to 50. Our empirical results show that the algorithm ...
      Master thesis
    • 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
    • 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
    • Security in cloud computing and virtual environments 

      Aarseth, Raymond (The University of Bergen, 2015-09-14)
      Cloud computing is a big buzzwords today. Just watch the commercials on TV and I can promise that you will hear the word cloud service at least once. With the growth of cloud technology steadily rising, and everything ...
      Master thesis
    • Choice of parameter for DP-based FPT algorithms: four case studies 

      Sæther, Sigve Hortemo (The University of Bergen, 2015-09-07)
      This thesis studies dynamic programming algorithms and structural parameters used when solving computationally hard problems. In particular, we look at algorithms that make use of structural decompositions to overcome ...
      Doctoral thesis
    • Projective Simulation compared to reinforcement learning 

      Bjerland, Øystein Førsund (The University of Bergen, 2015-06-01)
      This thesis explores the model of projective simulation (PS), a novel approach for an artificial intelligence (AI) agent. The model of PS learns by interacting with the environment it is situated in, and allows for ...
      Master 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
    • Localizing Cell Towers from Crowdsourced Measurements 

      Rusvik, Johan Alexander Nordstrand (The University of Bergen, 2015-06-01)
      Today, several internet sites exist that aim to provide the locations and number of cellular network antennas worldwide. For example [1],[2] and [3]. What makes this task difficult to accomplish is the lack of information ...
      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
    • Maximum number of objects in graph classes. 

      Hellestø, Marit Kristine Astad (The University of Bergen, 2015-05-31)
      The focus of this thesis is the study and implementation of two exact exponential time algorihms. These algorihms finds and lists the number of minimal dominating sets and the number of minimal subset feedback vertex ...
      Master thesis
    • SMS One-Time Passwords, Security in Two-Factor Authentication 

      Eide, Jan-Erik Lothe (The University of Bergen, 2015-05-29)
      In the past decade, the low price and ease of generating and sending large amounts of SMS have made it possible for many online services to create strong and affordable authentication systems. With the growth of smartphones ...
      Master thesis
    • Implementasjon av attributtbasert tilgangskontroll i elektroniske helsesystemer 

      Kristensen, André Sæ (The University of Bergen, 2015-05-28)
      Tilgangskontroll er et av de viktigste temaene innenfor informasjonssikkerhet[10]. Sensitiv data bør bare kunne aksesseres av autoriserte brukere eller programmer. Denne oppgaven har som hovedmål å undersøke den nåværende ...
      Master thesis
    • Maximum number of edges in graph classes under degree and matching constraints 

      Måland, Erik Kvam (The University of Bergen, 2015-05-12)
      In extremal graph theory, we ask how large or small a property of a graph can be, when the graph has to satisfy certain constraints. In this thesis, we ask how many edges a graph can have with restrictions on its degree ...
      Master thesis
    • Skaping av meirverdi gjennom opne data om kollektivtrafikk 

      Bergheim, Livar (The University of Bergen, 2015-05-04)
      Tema i denne oppgåva er opne data, med ei avgrensing mot kollektivtrafikkdata. Djupnestudien er retta mot verksemda til Skyss, det fylkeskommunale kollektivtrafikkselskapet i Hordaland. Omgrepet opne data" inneber ...
      Master thesis
    • Community Detection in Social Networks 

      Fasmer, Erlend Eindride (The University of Bergen, 2015-05-01)
      Social networks usually display a hierarchy of communities and it is the task of community detection algorithms to detect these communities and preferably also their hierarchical relationships. One common class of ...
      Master thesis
    • 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
    • Visibility-oriented Visualization Design for Flow Illustration 

      Brambilla, Andrea (The University of Bergen, 2014-12-18)
      Flow phenomena are ubiquitous in our world and they affect many aspects of our daily life. For this reason, they are the subject of extensive studies in several research fields. In medicine, the blood flow through our ...
      Doctoral thesis
    • Managing spatial selections with contextual snapshots 

      Mindek, Peter; Gröller, Eduard; Bruckner, Stefan (Wiley, 2014-12)
      Spatial selections are a ubiquitous concept in visualization. By localizing particular features, they can be analysed and compared in different views. However, the semantics of such selections often depend on specific ...
      Journal article
    • Community-driven development for computational biology at Sprints, Hackathons and Codefests 

      Möller, Steffen; Afgan, Enis; Banck, Michael; Bonnal, Raoul J. P.; Booth, Timothy; Chilton, John; Cock, Peter J. A.; Gumbel, Markus; Harris, Nomi; Holland, Richard; Kalaš, Matúš; Kaján, László; Kibukawa, Eri; Powel, David R.; Prins, Pjotr; Quinn, Jacqueline; Sallou, Olivier; Strozzi, Francesco; Seemann, Torsten; Sloggett, Clare; Soiland-Reyes, Stian; Spooner, William; Steinbiss, Sascha; Tille, Andreas; Travis, Anthony J.; Guimera, Roman V.; Katayama, Toshiaki; Chapman, Brad A. (BioMed Central, 2014-11-27)
      Background: Computational biology comprises a wide range of technologies and approaches. Multiple technologies can be combined to create more powerful workflows if the individuals contributing the data or providing tools ...
      Journal article