Blar i Department of Informatics på tittel
Viser treff 198217 av 643

Fast and accurate CNNbased brushing in scatterplots
(Journal article; Peer reviewed, 2018)Brushing plays a central role in most modern visual analytics solutions and effective and efficient techniques for data selection are key to establishing a successful human‐computer dialogue. With this paper, we address ... 
Fast biclustering by dual parameterization
(Conference object; 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 NPhard, none ... 
Fast Method for MaximumFlow Problem with MinimumLot Sizes
(Master thesis, 20150303)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 minimumlot size. ... 
Fast methods to solve the pooling problem
(Master thesis, 20140531)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, 20170620)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, 20101216) 
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 wholegenome 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 even subgraphs even faster
(Conference object; 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 Induced Subgraphs via Minimal Triangulations
(Conference object; 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 Fillin and Treewidth. We discover unexpected ... 
Finding k Disjoint Triangles in an Arbitrary Graph
(Conference object, 2004) 
Finding Resource Bounds in the Presence of Explicit Deallocation
(Journal article, 20051017)A software program requesting a resource that is not available usually raises an outofresource exception. Component software is software that has been assembled from standardized, reusable components which, in turn, may ... 
Finite and Confident Teaching in Expectation: Sampling from Infinite Concept Classes
(Frontiers in Artificial Intelligence and Applications;325, Chapter, 2020)We investigate the teaching of infinite concept classes through the effect of the learning prior (which is used by the learner to derive posteriors giving preference of some concepts over others and by the teacher to devise ... 
Firewalls: Enforcement of Security Policy in networks
(Master thesis, 20141120)Firewalls are set up to protect computer networks. Originally, networks were just coupled together, in order to achieve connection. With the ability to reach networks all over the world, one started to denote this the ... 
A FixedParameter Perspective on #BIS
(Peer reviewed; Journal article, 20190718)The problem of (approximately) counting the independent sets of a bipartite graph (#BIS) is the canonical approximate counting problem that is complete in the intermediate complexity class #RHΠ1. It is believed that #BIS ... 
Floating Fault Analysis of Trivium
(Lecture Notes in Computer Science; 5365, Chapter; Peer reviewed, 2008)One of the eSTREAM final portfolio ciphers is the hardwareoriented stream cipher Trivium. It is based on 3 nonlinear feedback shift registers with a linear output function. Although Trivium has attached a lot of interest, ... 
Formulas as programs
(Master thesis, 2003)Alma0 is a programming language supporting declarative programming, which combines the advantages of imperative and logic programming paradigms. This work explores declarative programming by extending the interpretation ... 
FPT Algorithms for Diverse Collections of Hitting Sets
(Peer reviewed; Journal article, 20191127)In this work, we study the dHitting Set and Feedback Vertex Set problems through the paradigm of finding diverse collections of r solutions of size at most k each, which has recently been introduced to the field of ...