Browsing Department of Informatics by Title
Now showing items 375394 of 767

A matrixfree method for regularisation with unrestricted variables
(Master thesis, 2008)In this thesis a method for the partially norm constrained least squares problem is presented. The method relies on a largescale trustregion solver and has a low storage requirement. A combination of image misalignment ... 
Maximum matching width: New characterizations and a fast algorithm for dominating set
(Conference object; Peer reviewed; Journal article, 2015)We give alternative definitions for maximum matching width, e.g., a graph G has mmw(G) <= k if and only if it is a subgraph of a chordal graph H and for every maximal clique X of H there exists A,B,C \subseteq X with A ... 
Maximum number of edges in graph classes under degree and matching constraints
(Master thesis, 20150512)In extremal graph theory, we ask how large or small a property of a graph can be, when the graph has to satisfy certain constraints. In this thesis, we ask how many edges a graph can have with restrictions on its degree ... 
Maximum number of objects in graph classes.
(Master thesis, 20150531)The focus of this thesis is the study and implementation of two exact exponential time algorihms. These algorihms finds and lists the number of minimal dominating sets and the number of minimal subset feedback vertex sets ... 
Measures in Visualization Space
(Chapter, 2020)Measurement is an integral part of modern science, providing the fundamental means for evaluation, comparison, and prediction. In the context of visualization, several different types of measures have been proposed, ranging ... 
MedUse: A Visual Analysis Tool for Medication Use Data in the ABCD Study
(Peer reviewed; Journal article, 2019)The RxNorm vocabulary is a yearlypublished biomedical resource providing normalized names for medications. It is used to capture medication use in the Adolescent Brain Cognitive Development (ABCD) study, an active and ... 
Memento: Localized time‐warping for spatio‐temporal selection
(Peer reviewed; Journal article, 2020)Interaction techniques for temporal data are often focused on affecting the spatial aspects of the data, for instance through the use of transfer functions, camera navigation or clipping planes. However, the temporal aspect ... 
The mersenne low hamming combination search problem can be reduced to an ILP problem
(Lecture Notes in Computer Science, Chapter; Peer reviewed; Journal article, 2019)In 2017, Aggarwal, Joux, Prakash, and Santha proposed an innovative NTRUlike publickey cryptosystem that was believed to be quantum resistant, based on Mersenne prime numbers q=2N−1 . After a successful attack designed ... 
Metagenomeassembled genome distribution and key functionality highlight importance of aerobic metabolism in Svalbard permafrost
(Journal article; Peer reviewed, 2020)Permafrost underlies a large portion of the land in the Northern Hemisphere. It is proposed to be an extreme habitat and home for coldadaptive microbial communities. Upon thaw permafrost is predicted to exacerbate increasing ... 
Metagenomic tools in microbial ecology research
(Journal article; Peer reviewed, 2021)Ability to directly sequence DNA from the environment permanently changed microbial ecology. Here, we review the new insights to microbial life gleaned from the applications of metagenomics, as well as the extensive set ... 
Methods for analysing 2D electrophoretic gel images
(Master thesis, 2002) 
Metric Dimension Parameterized By Treewidth
(Journal article; Peer reviewed, 2021)A resolving set S of a graph G is a subset of its vertices such that no two vertices of G have the same distance vector to S. The METRIC DIMENSION problem asks for a resolving set of minimum size, and in its decision form, ... 
MimWidth II. The Feedback Vertex Set Problem
(Peer reviewed; Journal article, 2020)We give a first polynomialtime algorithm for (WEIGHTED) FEEDBACK VERTEX SET on graphs of bounded maximum induced matching width (mimwidth). Explicitly, given a branch decomposition of mimwidth w, we give an nO(w)time ... 
MimWidth III. Graph powers and generalized distance domination problems
(Peer reviewed; Journal article, 2019)We generalize the family of (σ,ρ) problems and locally checkable vertex partition problems to their distance versions, which naturally captures wellknown problems such as Distancer Dominating Set and Distancer Independent ... 
Mind Your Outcomes: The ∆QSD Paradigm for QualityCentric Systems Development and Its Application to a Blockchain Case Study
(Journal article; Peer reviewed, 2022)This paper directly addresses a longstanding issue that affects the development of many complex distributed software systems: how to establish quickly, cheaply, and reliably whether they can deliver their intended performance ... 
Minimizing Fillin Size and Elimination Tree Height in Parallel Cholesky Factorization
(Master thesis, 1992) 
Minimum Fillin of Sparse Graphs: Kernelization and Approximation
(Conference object; Peer reviewed; Journal article, 2011)The Minimum Fillin problem is to decide if a graph can be triangulated by adding at most k edges. The problem has important applications in numerical algebra, in particular in sparse matrix computations. We develop ... 
A minimum requiring angle trisection
(Peer reviewed; Journal article, 2009) 
MOCCA: a fexible suite for modelling DNA sequence motif occurrence combinatorics
(Journal article; Peer reviewed, 2021)Background Cisregulatory elements (CREs) are DNA sequence segments that regulate gene expression. Among CREs are promoters, enhancers, Boundary Elements (BEs) and Polycomb Response Elements (PREs), all of which are ... 
Model Checking Healthcare Workflows Using Alloy
(Conference object; Peer reviewed, 2014)Workflows are used to organize business processes, and workflow management tools are used to guide users in which order these processes should be performed. These tools increase organizational efficiency and enable users ...