Blar i Department of Informatics på tittel
Viser treff 360-379 av 1199
-
Enhancing Dementia Diagnosis through Mobile Technology -Development and Evaluation of a Cognitive Assessment Application
(Master thesis, 2023-12-01) -
An Ensemble Feature Selection Framework Integrating Stability
(Chapter; 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
(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, 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 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 ... -
ETH-Tight Algorithms for Finding Surfaces in Simplicial Complexes of Bounded Treewidth
(Journal article; Peer reviewed, 2022)Given a simplicial complex with n simplices, we consider the Connected Subsurface Recognition (c-SR) problem of finding a subcomplex that is homeomorphic to a given connected surface with a fixed boundary. We also study ... -
ETH-tight 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 ... -
Evaluating vascular visualization methods for pre-operative planning in the mesentery
(Master thesis, 2021-11-26)In this thesis I evaluate and compare a selection of vascular visualization methods with the help of surgeons. Vessel topology is highly varied, and individuals may have extra or "missing" branches, changes in connectivity, ... -
Evaluation and Improvement of Machine Learning Algorithms in Drug Discovery
(Master thesis, 2022-06-01)Drug discovery plays a critical role in today’s society for treating and preventing sickness and possibly deadly viruses. In early drug discovery development, the main challenge is to find candidate molecules to be used ... -
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 MAX-2SAT and MAX-3SAT via multidimensional matrix multiplication
(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
(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 view-point of moderately exponential time algorithms, both exactly and approximately. Motivated by the definitions of ... -
Exact Exponential Algorithms for Clustering Problems
(Journal article; Peer reviewed, 2022)In this paper we initiate a systematic study of exact algorithms for some of the well known clustering problems, namely k-MEDIAN and k-MEANS. In k-MEDIAN, the input consists of a set X of n points belonging to a metric ... -
Exact methods for solving the small scale single vehicle pickup and delivery problem with time windows
(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, ... -
Exercise-induced Laryngeal Obstruction Diagnostics Using Machine Learning
(Master thesis, 2024-06-03)Exercise-induced laryngeal obstruction (EILO), characterized by laryngeal narrowing during physical exercise, poses a significant challenge, especially for athletes and active youth, impacting performance and quality of ... -
Experimental construction of optimal cryptographic functions by expansion
(Master thesis, 2021-09-13) -
Experimental Study on One-Time Password used in Authentication within Norwegian Banking
(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
(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 ...