Now showing items 173-192 of 643

    • Elastic Grid Resources using Cloud Technologies 

      Carlsen, Joachim Christoffer (Master thesis, 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 ...
    • The EMBRACE web service collection 

      Pettifer, Steve; Ison, Jon; Kalaš, Matúš; Thorne, David; McDermott, Philip; Jonassen, Inge; Ali, Liaquat; Fernandez, Jose M; Rodriguez, Jose M; Pisano, David G; Blanchet, Christophe; Uludag, Mahmut; Rice, Peter; Bartaseviciute, Edita; Rapacki, Kristoffer; Hekkelman, Maarten; Sand, Olivier; Stockinger, Heinz; Clegg, Andrew B; Bongcam-Rudloff, Eric; Salzemann, Jean; Breton, Vincent; Attwood, Teresa K; Cameron, Graham; Vriend, Gert (Peer reviewed; Journal article, 2010-05-10)
      The EMBRACE (European Model for Bioinformatics Research and Community Education) web service collection is the culmination of a 5-year project that set out to investigate issues involved in developing and deploying web ...
    • Employing Deep Learning for Fish Recognition 

      Reithaug, Adrian (Master thesis, 2018-08-21)
      Underwater imagery processing is in high demand, but the unrestricted environment makes it difficult to develop methods for analyzing it. Not only is obtaining a dataset for a single species difficult, but there are reported ...
    • Energy-scale Aware Feature Extraction for Flow Visualization 

      Pobitzer, Armin; Tutkun, Murat; Anreassen, Øyvind; Fuchs, Raphael; Peikert, Ronald; Hauser, Helwig (Peer reviewed; Journal article, 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 ...
    • Enhancing Content Management in DPG 

      Pino Arevalo, Ana Gabriela (Master thesis, 2013-11-20)
      This thesis analyzes the usability aspects of PCE and implements a new Single Page Application that attempts to solve this issues
    • An Ensemble Feature Selection Framework Integrating Stability 

      Zhang, Xiaokang; Jonassen, Inge (Chapter; Conference object; Peer reviewed, 2019)
      Ensemble feature selection has drawn more and more attention in recent years. There are mainly two strategies for ensemble feature selection, namely data perturbation and function perturbation. Data perturbation performs ...
    • Enumerating minimal connected dominating sets in graphs of bounded chordality 

      Golovach, Petr; Heggernes, Pinar; Kratsch, Dieter (Conference object; Peer reviewed; Journal article, 2015)
      Listing, generating or enumerating objects of specified type is one of the principal tasks in algorithmics. In graph algorithms one often enumerates vertex subsets satisfying a certain property. We study the enumeration ...
    • Error Detection and Correction for Symmetric and Asymmetric Channels 

      Naydenova, Irina Petkova (Doctoral thesis, 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 message. ...
    • ETH-tight algorithms for long path and cycle on unit disk graphs 

      Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav (Journal article; Peer reviewed, 2020)
      We present an algorithm for the extensively studied Long Path and Long Cycle problems on unit disk graphs that runs in time 2O(√k)(n + m). Under the Exponential Time Hypothesis, Long Path and Long Cycle on unit disk graphs ...
    • Evolution and developmental system drift in the endoderm gene regulatory network of Caenorhabditis and other nematodes 

      Ewe, Chee Kiang; Torres Cleuren, Yamila Nicole; Rothman, Joel H (Journal article; Peer reviewed, 2020)
      Developmental gene regulatory networks (GRNs) underpin metazoan embryogenesis and have undergone substantial modification to generate the tremendous variety of animal forms present on Earth today. The nematode Caenorhabditis ...
    • Exact algorithms for MAX-2SAT and MAX-3SAT via multidimensional matrix multiplication 

      Petkevich, Yevgheni (Master thesis, 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 ...
    • Exact algorithms for treewidth and minimum fill-in 

      Fomin, Fedor; Todinca, Ioan; Kratsch, Dieter; Villanger, Yngve (Journal article, 2006)
    • Exact and approximate digraph bandwidth 

      Jain, Pallavi; Kanesh, Lawqueen; Lochet, William; Saurabh, Saket; Sharma, Roohani (Journal article; Peer reviewed, 2019)
      In this paper, we introduce a directed variant of the classical Bandwidth problem and study it from the view-point of moderately exponential time algorithms, both exactly and approximately. Motivated by the definitions of ...
    • Exact methods for solving the small scale single vehicle pickup and delivery problem with time windows 

      Lakel, Yacine Mohamed (Master thesis, 2016-08-15)
      The single vehicle pickup and delivery problem with time windows (1-PDPTW) is a wellknown problem in transportation and combinatorics. In practice, these routes are relatively small with less then 30 stops. In this thesis, ...
    • Experimental Study on One-Time Password used in Authentication within Norwegian Banking 

      Naguleswaran, Sivanja (Master thesis, 2020-06-26)
      Authentication is a vital part of this fast-growing, digitalized world. Fundamentally, today’s society is more reliant on computer technology and digitalization than ever before. Therefore, the use of dynamic one-time ...
    • Exploiting graph structures for computational efficiency 

      Strømme, Torstein Jarl Fagerbakke (Doctoral thesis, 2020-05-07)
      Coping with NP-hard graph problems by doing better than simply brute force is a field of significant practical importance, and which have also sparked wide theoretical interest. One route to cope with such hard graph ...
    • Exploring graph parameters similar to tree-width and path-width 

      Nordstrand, Joakim Alme (Master thesis, 2017-07-04)
      In a recent paper appearing at IPEC 2015, ”Maximum matching width: new characterization and fast algorithms for dominating set” [12], three similar treelike parameters, tree-width, branch-width and maximum matching-width, ...
    • Exploring Microservice Security 

      Yarygina, Tetiana (Doctoral thesis, 2018-10-10)
      Due to rapid transitioning towards digitalized society and extended reliance on interconnected digital systems, computer security is a field of growing importance. Software that we build should be secure, resilient and ...
    • Exploring MultiPath TCP Through Discrete Event Simulation 

      Hexeberg, Henrik Libeck (Master thesis, 2021-06-01)
      Global internet usage is rapidly becoming more mobile. Devices are, as a consequence, equipped with multiple network interfaces to meet the demand for mobility. With the emergence of 5G-technology, this trend will most ...
    • Exploring Subexponential Parameterized Complexity of Completion Problems 

      Drange, Pål Grønås; Fomin, Fedor; Pilipczuk, Michal Pawel; Villanger, Yngve (Peer reviewed; Journal article, 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 graph ...