Blar i Department of Informatics på tittel
Viser treff 208227 av 762

Enhancing Content Management in DPG
(Master thesis, 20131120)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
(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
(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 ... 
eQTLs as causal instruments for the reconstruction of hormone linked gene networks
(Journal article; Peer reviewed, 2022)Hormones act within in highly dynamic systems and much of the phenotypic response to variation in hormone levels is mediated by changes in gene expression. The increase in the number and power of large genetic association ... 
Error Detection and Correction for Symmetric and Asymmetric Channels
(Doctoral thesis, 20070827)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 Geometric Intersection Graphs: Now in Polynomial Space
(Journal article; Peer reviewed, 2021)De Berg et al. in [SICOMP 2020] gave an algorithmic framework for subexponential algorithms on geometric graphs with tight (up to ETH) running times. This framework is based on dynamic programming on graphs of weighted ... 
ETHtight algorithms for long path and cycle on unit disk graphs
(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
(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 MAX2SAT and MAX3SAT via multidimensional matrix multiplication
(Master thesis, 20150601)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 fillin
(Journal article, 2006) 
Exact and approximate digraph bandwidth
(Journal article; Peer reviewed, 2019)In this paper, we introduce a directed variant of the classical Bandwidth problem and study it from the viewpoint 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
(Master thesis, 20160815)The single vehicle pickup and delivery problem with time windows (1PDPTW) 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 OneTime Password used in Authentication within Norwegian Banking
(Master thesis, 20200626)Authentication is a vital part of this fastgrowing, digitalized world. Fundamentally, today’s society is more reliant on computer technology and digitalization than ever before. Therefore, the use of dynamic onetime ... 
Exploiting graph structures for computational efficiency
(Doctoral thesis, 20200507)Coping with NPhard 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 treewidth and pathwidth
(Master thesis, 20170704)In a recent paper appearing at IPEC 2015, ”Maximum matching width: new characterization and fast algorithms for dominating set” [12], three similar treelike parameters, treewidth, branchwidth and maximum matchingwidth, ... 
Exploring Microservice Security
(Doctoral thesis, 20181010)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
(Master thesis, 20210601)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 5Gtechnology, this trend will most ... 
Exploring Subexponential Parameterized Complexity of Completion Problems
(Peer reviewed; Journal article, 20140219)Let F be a family of graphs. In the FCompletion problem, we are given an nvertex 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 ... 
Exploring the evolution of protein function in Archaea
(Peer reviewed; Journal article, 20120530)Background: Despite recent progress in studies of the evolution of protein function, the questions what were the first functional protein domains and what were their basic building blocks remain unresolved. Previously, we ... 
Exponential time algorithms: Structures, measures, and bounds
(Doctoral thesis, 20081205)This thesis studies exponential time algorithms, more precisely, algorithms exactly solving problems for which no polynomial time algorithm is known and likely to exist. Interested in worst–case upper bounds on the running ...