Blar i Department of Informatics på tittel
Viser treff 366-385 av 1114
-
Facilitating Dynamic Assessment of Psychological Interventions
(Master thesis, 2021-07-16)The mental healthcare system requires an improvement in patient accessibility and a decrease in resource dependency. Internet-Delivered Psychological Treatment (IDPT) is a tool with a documented positive effect to bring ... -
Facilitating Extended Reality in Museums through a Web-Based Application
(Master thesis, 2023-06-01) -
FAIR+E pathogen data for surveillance and research: lessons from COVID-19
(Journal article; Peer reviewed, 2023)The COVID-19 pandemic has exemplified the importance of interoperable and equitable data sharing for global surveillance and to support research. While many challenges could be overcome, at least in some countries, many ... -
Fast biclustering by dual parameterization
(Peer reviewed; Journal article, 2015)We study two clustering problems, Starforest Editing, the problem of adding and deleting edges to obtain a disjoint union of stars, and the generalization Bicluster Editing. We show that, in addition to being NP-hard, none ... -
Fast Method for Maximum-Flow Problem with Minimum-Lot Sizes
(Master thesis, 2015-03-03)In transportation networks, such as pipeline networks for transporting natural gas, it is often impractical to send across amounts of flow below a certain threshold. Such lower threshold is referred as the minimum-lot size. ... -
Fast methods to solve the pooling problem
(Master thesis, 2014-05-31)In pipeline transportation of natural gas, simple network flow problems are replaced by hard ones when bounds on the flow quality are imposed. The sources, typically represented by gas wells, provide flow of unequal ... -
Faster enumeration of minimal connected dominating sets in split graphs
(Master thesis, 2017-06-20)Graphs are mathematical objects that can be used to model many real world problems. An example is a roadmap, where the nodes in the graph represent cities and the edges of the graph represent roads. An interesting and ... -
Fault tolerant subgraphs with applications in kernelization
(Journal article; Peer reviewed, 2020)In the past decade, the design of fault tolerant data structures for networks has become a central topic of research. Particular attention has been given to the construction of a subgraph H of a given digraph D with as ... -
Feasible Algorithms for Semantics — Employing Automata and Inference Systems
(Doctoral thesis, 2010-12-16) -
Feature Selection for Identification of Transcriptome and Clinical Biomarkers for Relapse in Colon Cancer
(Master thesis, 2021-06-01)This study attempts to find good predictive biomarkers for recurrence in colon cancer between two data sources of both mRNA and miRNA expression from frozen tumor samples. In total four datasets, two data sources and two ... -
Features impacting the mesopelagic layer in the ocean: a machine learning-based approach
(Master thesis, 2022-09-01)Context: Recently the United Nations proclaimed a Decade of Ocean Science for Sustainable Development (2021–2030) due to threats to the productivity and health of the ocean due to human impact. The One Ocean Expedition ... -
Filtering duplicate reads from 454 pyrosequencing data
(Peer reviewed; Journal article, 2013)Motivation: Throughout the recent years, 454 pyrosequencing has emerged as an efficient alternative to traditional Sanger sequencing and is widely used in both de novo whole-genome sequencing and metagenomics. Especially ... -
Filtering of FTLE for Visualizing Spatial Separation in Unsteady 3D Flow
(Peer reviewed; Journal article, 2012)In many cases, feature detection for flow visualization is structured in two phases: first candidate identification, and then filtering. With this paper, we propose to use the directional information contained in the ... -
Finding Common Grounds: The Moral Machine Case
(Master thesis, 2023-03-06) -
Finding even subgraphs even faster
(Peer reviewed; Journal article, 2015)Problems of the following kind have been the focus of much recent research in the realm of parameterized complexity: Given an input graph (digraph) on n vertices and a positive integer parameter k, find if there exist k ... -
Finding haplotypic signatures in proteins
(Journal article; Peer reviewed, 2023)Background The nonrandom distribution of alleles of common genomic variants produces haplotypes, which are fundamental in medical and population genetic studies. Consequently, protein-coding genes with different ... -
Finding Induced Subgraphs via Minimal Triangulations
(Peer reviewed; Journal article, 2010)Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems in- cluding Minimum Fill-in and Treewidth. We discover unexpected ... -
Finding k Disjoint Triangles in an Arbitrary Graph
(Journal article; Peer reviewed, 2004)We consider the NP-complete problem of deciding whether an input graph on n vertices has k vertex-disjoint copies of a fixed graph H. For H=K 3 (the triangle) we give an O(22klog k + 1.869k n 2) algorithm, and for general ... -
Finding Resource Bounds in the Presence of Explicit Deallocation
(Journal article, 2005-10-17)A software program requesting a resource that is not available usually raises an out-of-resource exception. Component software is software that has been assembled from standardized, reusable components which, in turn, may ... -
Finding shared RSA factors in the Certificate Transparency logs
(Master thesis, 2022-05-13)When generating RSA keys, proper random generators are crucial. If the generators are not truly random, keys may be generated with the same factors, making them vulnerable to compromise. Doing a simple greatest common ...