Blar i Department of Informatics på tittel
Viser treff 592-611 av 1130
-
Maximum number of edges in graph classes under degree and matching constraints
(Master thesis, 2015-05-12)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 Edges in Graphs Under Various Constraints
(Master thesis, 2019-06-26) -
Maximum number of objects in graph classes.
(Master thesis, 2015-05-31)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 ... -
Maximum weighted matching on a GPU
(Master thesis, 2020-11-12)In this thesis we give the first parallel GPU-implementation of the ROMA algorithm suited for complete graphs. ROMA is an approximation algorithm solving the maximum weighted matching problem. Our algorithm achieves an ... -
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 ... -
Measuring Adversarial Robustness using a Voronoi-Epsilon Adversary
(Journal article; Peer reviewed, 2023)Previous studies on robustness have argued that there is a tradeoff between accuracy and adversarial accuracy. The tradeoff can be inevitable even when we neglect generalization. We argue that the tradeoff is inherent to ... -
MedUse: A Visual Analysis Tool for Medication Use Data in the ABCD Study
(Peer reviewed; Journal article, 2019)The RxNorm vocabulary is a yearly-published 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 NTRU-like public-key cryptosystem that was believed to be quantum resistant, based on Mersenne prime numbers q=2N−1 . After a successful attack designed ... -
Metagenome-assembled 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 cold-adaptive 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, ... -
MetZoom: A CNN/LSTM hybrid based model for water reservoir inflow prediction
(Master thesis, 2022-06-01)Hydropower reservoir volumes fluctuate as water levels increase or decrease according to precipitation, valve output and inflow through water retained in the surrounding area. Predicting these fluctuations with machine ... -
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)