Now showing items 33-52 of 371

    • 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
    • Community Detection on the GPU 

      Naim, Md.; Manne, Fredrik; Halappanavar, Mahantesh; Tumeo, Antonino (IEEE, 2017)
      We present and evaluate a new GPU algorithm based on the Louvain method for community detection. Our algorithm is the first for this problem that parallelizes the access to individual edges. In this way we can fine tune ...
      Conference object
    • 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
    • A Comparative Analysis of MongoDB and Cassandra 

      Bhamra, Kavita (The University of Bergen, 2018-01-03)
      NoSQL is a group of database technologies that emerged due to the limitations of relational databases. The number of NoSQL technologies has increased over time to encompass hundreds of different technologies. The many NoSQL ...
      Master thesis
    • A Comparative Study on Distributed Storage and Erasure Coding Techniques Using Apache Hadoop Over NorNet Core 

      Vela, Maximiliano Matias (The University of Bergen, 2018-01-24)
      Both private and public sector organizations are constantly looking for new ways to keep their information safe and accessible at all times. Over the past few decades, replication has always been a reliable way to make ...
      Master thesis
    • Comparative Visualization of Protein Secondary Structures 

      Kocincova, Lucia; Jaresova, Miroslava; Byska, Jan; Parulek, Julius; Hauser, Helwig; Kozlikova, Barbora (BioMed Central, 2017-02-15)
      Background: Protein function is determined by many factors, namely by its constitution, spatial arrangement, and dynamic behavior. Studying these factors helps the biochemists and biologists to better understand the protein ...
      Journal article
    • Comparing 17 graph parameters 

      Sasák, Róbert (The University of Bergen, 2010-08-02)
      Many parametrized problems were decided to be FPT or W-hard. However, there is still thousands of problems and parameters for which we do not know yet whether are FPT or W-hard. In this thesis, we provide a tool for extending ...
      Master thesis
    • Comparison of Discrete and Continuous Models for the Pooling Problem 

      Alfaki, Mohammed; Haugland, Dag (Dagstuhl Publishing, 2011)
      The pooling problem is an important global optimization problem which is encountered in many industrial settings. It is traditionally modeled as a bilinear, nonconvex optimization problem, and solved by branch-and-bound ...
      ChapterPeer reviewed
    • Comparison of OpenMP and Threading Building Blocks for expressing parallelism on shared-memory systems 

      Refsnes, Peder Rindal (The University of Bergen, 2011-02-01)
      The thesis offers a comparison of OpenMP and Intel Threading Building blocks. The two are threading packages used to express parallelism in programs. In addition, the thesis presents a promising scalable algorithm for ...
      Master thesis
    • Comparison of Solving Techniques for Non-linear Sparse Equations over Finite Fields with Application in Cryptanalysis 

      Schilling, Thorsten Ernst (The University of Bergen, 2008)
      The work on this thesis gives a summary of the Gluing/Agreeing techniques, as well as a reference implementation of this methods. Furthermore widely used SAT-solving techniques are explained and a short insight to the ...
      Master thesis
    • A Comparison of Vertex and Edge Partitioning Approaches for Parallel Maximal Matching 

      Sørnes, Alexander N (The University of Bergen, 2013-12-09)
      This thesis will compare two ways of distributing data for parallel graph algorithms: vertex and edge partitioning, using a distributed memory system. Previous studies on the parallelization of graphs has often been ...
      Master thesis
    • Computation of Treespan. A Generalization of Bandwidth to Treelike Structures 

      Dregi, Markus Sortland (The University of Bergen, 2012-06-14)
      Motivated by a search game, Fomin, Heggernes and Telle [Algorithmica, 2005] defined the graph parameter treespan, a generalization of the well studied parameter bandwidth. Treespan is the maximum number of appearances ...
      Master thesis
    • Computational analysis of the evolutionary dynamics of proteins on a genomic scale 

      Hughes, Timothy (The University of Bergen, 2007-01-16)
      Biology is primarily concerned with the study of all phenotypic aspects of living organisms and evolutionary biology is more specifically interested in elucidating how different phenotypes evolved. Proteins (and RNA ...
      Doctoral thesis
    • Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings 

      Pilipczuk, Michal Pawel (Dagstuhl Publishing, 2013)
      The notions of cutwidth and pathwidth of digraphs play a central role in the containment theory for tournaments, or more generally semi-complete digraphs, developed in a recent series of papers by Chudnovsky, Fradkin, Kim, ...
      Conference object
    • Computing minimal triangulation in Time o(n^2.376) 

      Heggernes, Pinar; Telle, Jan Arne; Villanger, Yngve (SIAM Journals, 2005)
      Journal article
    • Connecting Vertices by Independent Trees 

      Basavaraju, Manu; Fomin, Fedor; Golovach, Petr; Saurabh, Saket (Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, 2014)
      We study the paramereteized complexity of the following connectivity problem. For a vertex subset U of a graph G, trees T1, . . . , Ts of G are completely independent spanning trees of U if each of them contains U , and ...
      Conference object
    • Conserved BK Channel-Protein Interactions Reveal Signals Relevant to Cell Death and Survival 

      Sokolowski, Bernd; Orchard, Sandra; Harvey, Margaret; Sridhar, Settu; Sakai, Yoshihisa (Public Library of Science, 2011-12-09)
      The large-conductance Ca2+-activated K+ (BK) channel and its b-subunit underlie tuning in non-mammalian sensory or hair cells, whereas in mammals its function is less clear. To gain insights into species differences and ...
      Peer reviewedJournal article
    • Continuous Levels-of-Detail and Visual Abstraction for Seamless Molecular Visualization 

      Parulek, Julius; Jönsson, Daniel; Ropinski, Timo; Bruckner, Stefan; Ynnerman, Anders; Viola, Ivan (Wiley, 2014-05-06)
      Molecular visualization is often challenged with rendering of large molecular structures in real time. We introduce a novel approach that enables us to show even large protein complexes. Our method is based on the ...
      Journal article
    • Counting Instances of Software Components 

      Bezem, Marcus A.; Truong, Anh Hoang (University of Bergen, Department of Informatics, 2004-07-13)
      Component software is software that has been assembled from various pieces of standardized, reusable computer programs, so-called components. Executing component software creates instances of these components. For several ...
      Conference object
    • A critical view on Public Key Infrastructures 

      Tjøstheim, Thomas (The University of Bergen, 2004)
      Master thesis