Now showing items 177-196 of 273

  • Parallel Graph Algorithms for Combinatorial Scientific Computing 

    Patwary, Mostofa Ali (The University of Bergen, 2011-08-26)
    Doctoral thesis
  • Parameterized complexity of Eulerian deletion problems 

    Cygan, Marek; Pilipczuk, Marcin; Marx, Dániel; Pilipczuk, Michal Pawel; Schlotter, Ildikó (Springer, 2014-01)
    We study a family of problems where the goal is to make a graph Eulerian, i.e., connected and with all the vertices having even degrees, by a minimum number of deletions. We completely classify the parameterized complexity ...
    Journal article
  • Parsing in a Broad Sense 

    Zaytsev, Vadim; Bagge, Anya Helene (Springer, 2014)
    Having multiple representations of the same instance is common in software language engineering: models can be visualised as graphs, edited as text, serialised as XML. When mappings between such representations are considered, ...
  • Passive Cryptanalysis of the UnConditionally Secure Authentication Protocol for RFID Systems 

    Abyaneh, Mohammad Reza Sohizadeh (The author, 2012)
    Recently, Alomair et al. proposed the first Un- Conditionally Secure mutual authentication protocol for lowcost RFID systems(UCS-RFID). The security of the UCSRFID relies on five dynamic secret keys which are updated at ...
    Conference object
  • Perceptually Uniform Motion Space 

    Birkeland, Åsmund; Turkay, Cagatay; Viola, Ivan (IEEE, 2014-05-07)
    Flow data is often visualized by animated particles inserted into a flow field. The velocity of a particle on the screen is typically linearly scaled by the velocities in the data. However, the perception of velocity ...
    Journal article
  • Phase Transition in a System of Random Sparse Boolean Equations 

    Schilling, Thorsten Ernst; Zajac, Pavol (Versita Open, 2012)
    Many problems, including algebraic cryptanalysis, can be transformed to a problem of solving a (large) system of sparse Boolean equations. In this article we study 2 algorithms that can be used to remove some redundancy ...
    Peer reviewedChapter
  • A polynomial-time algorithm for LO based on generalized logarithmic barrier functions 

    El Ghami, Mohamed; Ivanov, I.D.; Roos, C.; Steihaug, Trond (Academic Publications, 2008)
    Peer reviewedJournal article
  • A polynomial-time solvable case for the NP-hard problem Cutwidth 

    Lilleeng, Simen (The University of Bergen, 2014-06-02)
    The Cutwidth problem is a notoriously hard problem, and its complexity is open on several interesting graph classes. Motivated by this fact we investigate the problem on superfragile graphs, a graph class on which the ...
    Master thesis
  • Practical Aspects of the Graph Parameter Boolean-width 

    Sharmin, Sadia (The University of Bergen, 2014-08-18)
    Doctoral thesis
  • Predicting Gene Regulatory Elements in Silico on a Genomic Scale 

    Brazma, Alvis; Jonassen, Inge; Vilo, Jaak; Ukkonen, Esko (Cold Spring Harbor Laboratory Press, 1998-05-18)
    We performed a systematic analysis of gene upstream regions in the yeast genome for occurrences of regular expression-type patterns with the goal of identifying potential regulatory elements. To achieve this goal, we have ...
    Journal article
  • Prediction and analysis of protein structure 

    Hollup, Siv Midtun (The University of Bergen, 2010-04-19)
    This thesis, which contains an introduction and four manuscripts, summarises my efforts during my the past four years to understand proteins, their structure and dynamics. The first manuscript presents a protocol that ...
    Doctoral thesis
  • Prediction of Polycomb/Trithorax Response Elements using Support Vector Machines 

    Bredesen, Bjørn Andre (The University of Bergen, 2013-06-03)
    Polycomb/Trithorax Response Elements (PREs) are epigenetic elements that can maintain established transcriptional states over multiple cell divisions. Sequence motifs in known PREs have enabled genome-wide PRE prediction ...
    Master thesis
  • A Pretty Good Formatting Pipeline 

    Bagge, Anya Helene; Hasu, Tero (Springer, 2013)
    Proper formatting makes the structure of a program apparent and aids program comprehension. The need to format code arises in code generation and transformation, as well as in normal reading and editing situations. ...
  • Programming with Explicit Dependencies. A Framework for Portable Parallel Programming 

    Burrows, Eva (2011-05-23)
    Computational devices are rapidly evolving into massively parallel systems. Multicore processors are already standard; high performance processors such as the Cell/BE processor, graphics processing units (GPUs) ...
    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
  • Proofs, Types and Lambda Calculus - datasets 

    Polonsky, Andrew (2012-02-28)
  • Protease-dependent fractional mass and peptide properties 

    Barsnes, Harald; Eidhammer, Ingvar; Cruciani, Véronique; Mikalsen, Svein-Ole (IM Publications, 2008-09-22)
    Mass spectrometric analyses of peptides mainly rely on cleavage of proteins with proteases that have a defined specificity. The specificities of the proteases imply that there is not a random distribution of amino acids ...
    Journal articlePeer reviewed
  • QALM - a tool for automating quantitative analysis of LC-MS-MS/MS data 

    Lerøy, Kjartan (The University of Bergen, 2010-05-31)
    The goal of bioinformatics is to support science and research in the field of biology through the application of information technology. Proteomics is a field within biology that deals with the study of proteins. This paper ...
    Master thesis
  • Quantum social networks 

    Cabello, Adán; Danielsen, Lars Eirik; López-Tarrida, Antonio J.; Portillo, José R. (Institute of Physics, 2012-06-27)
    We introduce a physical approach to social networks (SNs) in which each actor is characterized by a yes–no test on a physical system. This allows us to consider SNs beyond those originated by interactions based on pre-existing ...
    Peer reviewedJournal article
  • Randomised Construction and Dynamic Decoding of LDPC Codes 

    Knudsen, Joakim Grahl (The University of Bergen, 2005-11-30)
    Master thesis