Now showing items 257-276 of 400

    • Parallel algorithms for computing k-connectivity 

      Haakonsen, Joachim (The University of Bergen, 2017-05-05)
      Master thesis
    • Parallel algorithms for matching under preference 

      Lerring, Håkon Heggernes (The University of Bergen, 2017-06-20)
      Master thesis
    • Parallel Graph Algorithms for Combinatorial Scientific Computing 

      Patwary, Mostofa Ali (The University of Bergen, 2011-08-26)
      Doctoral thesis
    • Parallel Matching and Clustering Algorithms on GPUs 

      Naim, Md. (The University of Bergen, 2017-06-17)
      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
    • Parameterized complexity of secluded connectivity problems 

      Fomin, Fedor; Golovach, Petr; Karpov, Nikolay; Kulikov, Alexander S (Dagstuhl Publishing, 2015)
      The Secluded Path problem introduced by Chechik et al. in [ESA 2013] models a situation where a sensitive information has to be transmitted between a pair of nodes along a path in a network. The measure of the quality of ...
      Conference object
    • Parameterized complexity of the spanning tree congestion problem 

      Bodlaender, Hans L.; Fomin, Fedor; Golovach, Petr; Otachi, Yota; van Leeuwen, Erik Jan (Springer, 2012-09)
      We study the problem of determining the spanning tree congestion of a graph. We present some sharp contrasts in the parameterized complexity of this problem. First, we show that on apex-minor-free graphs, a general class ...
      Journal article
    • 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
    • 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
    • Precrec: fast and accurate precision-recall and ROC curve calculations in R 

      Saito, Takaya; Rehmsmeier, Marc (Oxford University Press, 2017)
      The precision–recall plot is more informative than the ROC plot when evaluating classifiers on imbalanced datasets, but fast and accurate curve calculation tools for precision–recall plots are currently not available. We ...
      Journal article
    • 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. ...