Blar i Department of Informatics på tittel
Viser treff 473-492 av 915
-
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, ... -
Mim-Width II. The Feedback Vertex Set Problem
(Peer reviewed; Journal article, 2020)We give a first polynomial-time algorithm for (WEIGHTED) FEEDBACK VERTEX SET on graphs of bounded maximum induced matching width (mim-width). Explicitly, given a branch decomposition of mim-width w, we give an nO(w)-time ... -
Mim-Width 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 well-known problems such as Distance-r Dominating Set and Distance-r Independent ... -
Mind Your Outcomes: The ∆QSD Paradigm for Quality-Centric Systems Development and Its Application to a Blockchain Case Study
(Journal article; Peer reviewed, 2022)This paper directly addresses a long-standing 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 Fill-in Size and Elimination Tree Height in Parallel Cholesky Factorization
(Master thesis, 1992) -
Minimum Fill-in of Sparse Graphs: Kernelization and Approximation
(Peer reviewed; Journal article, 2011)The Minimum Fill-in 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) -
Mining EL⊥ Bases with Adaptable Role Depth
(Journal article; Peer reviewed, 2023)In Formal Concept Analysis, a base for a finite structure is a set of implications that characterizes all valid implications of the structure. This notion can be adapted to the context of Description Logic, where the base ... -
MOCCA: a fexible suite for modelling DNA sequence motif occurrence combinatorics
(Journal article; Peer reviewed, 2021)Background Cis-regulatory 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
(Journal article; 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 ... -
Model Checking with the Sweep-Line Method
(Master thesis, 2017-06-21)Explicit-state model checking is a formal software verification technique that differs from peer review and unit testing, in that model checking does an exhaustive state space search. With model checking one takes a system ... -
A model driven approach to the design of a gamified e-learning system for clinical guidelines
(Peer reviewed; Journal article, 2019-08-21)Clinical practice guidelines (CPGs) are indispensable in the practice of evidence-based medicine. However, the cost of effective CPG dissemination strategies is prohibitive and not cost-effective. Therefore, scalable ... -
A model for optimal fleet composition of vessels for offshore wind farm maintenance
(Peer reviewed; Journal article, 2017)We present a discrete optimisation model that chooses an optimal fleet of vessels to support maintenance operations at Offshore Wind Farms (OFWs). The model is presented as a bi-level problem. On the first (tactical) level, ... -
A Model of Type Theory in Cubical Sets
(Peer reviewed; Journal article, 2014)We present a model of type theory with dependent product, sum, and identity, in cubical sets. We describe a universe and explain how to transform an equivalence between two types into an equality. We also explain how to ... -
Model-based clustering of multi-tissue gene expression data
(Journal article; Peer reviewed, 2020)Motivation Recently, it has become feasible to generate large-scale, multi-tissue gene expression data, where expression profiles are obtained from multiple tissues or organs sampled from dozens to hundreds of individuals. ... -
Model-based exploration of hypokalemia in dairy cows
(Journal article; Peer reviewed, 2022)Hypokalemia in dairy cows, which is characterized by too low serum potassium levels, is a severe mineral disorder that can be life threatening. In this paper, we explore different originating conditions of hypokalemia—reduced ... -
Model-based exploration of the impact of glucose metabolism on the estrous cycle dynamics in dairy cows
(Peer reviewed; Journal article, 2020)Background: Nutrition plays a crucial role in regulating reproductive hormones and follicular development in cattle. This is visible particularly during the time of negative energy balance at the onset of milk production ... -
Model-based Visualization for Medical Education and Training
(Peer reviewed; Journal article, 2019)Anatomy, or the study of the structure of the human body, is an essential component of medical education. Certain parts of human anatomy are considered to be more complex to understand than others, due to a multitude of ... -
Model-Driven Automatic Question Generation for a Gamified Clinical Guideline Training System
(Journal article; Peer reviewed, 2020)Clinical practice guidelines (CPGs) are a cornerstone of modern medical practice since they summarize the vast medical literature and provide care recommendations based on the current best evidence. However, there are ... -
Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms
(Journal article; Peer reviewed, 2022)The Learning with Errors (LWE) problem receives much attention in cryptography, mainly due to its fundamental significance in post-quantum cryptography. Among its solving algorithms, the Blum-Kalai-Wasserman (BKW) algorithm, ...