Blar i Department of Informatics på tittel
Viser treff 334-353 av 1114
-
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, ... -
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 ... -
Exploration of Linear-Algebra Graph Algorithms on the Graphcore IPU
(Master thesis, 2023-11-20)More specialized hardware is being created to improve the efficiency of demanding algorithms. Graphcore introduced their Intelligence processors: a specialized true MIMD architecture which specializes in machine learning ... -
Exploring Capability-based security in software design with Rust
(Master thesis, 2022-06-01)Access control is one of the most critical aspects of software engineering when designing secure software. In 2021, the Open Web Application Security Project (OWASP)foundation_owasp_nodate released a new Top10 several years ... -
Exploring graph parameters similar to tree-width and path-width
(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 Hardware Agnostic Multiarrays in Magnolia
(Master thesis, 2022-06-01)We present a specification and implementation of a generic multiarray API based on A Mathematics of Arrays in the general purpose research language Magnolia. We show how we can lift the reasoning on arrays to a more abstract ... -
Exploring Microservice Security
(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
(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 ...