Blar i Department of Informatics på tittel
Viser treff 311-330 av 981
-
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) -
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; Chapter, 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
(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; Peer reviewed, 2005)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 ... -
Fine-grained parameterized complexity analysis of graph coloring problems
(Journal article; Peer reviewed, 2023)The q-Coloring problem asks whether the vertices of a graph can be properly colored with q colors. In this paper we perform a fine-grained analysis of the complexity of q- Coloring with respect to a hierarchy of structural ... -
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, 2014-11-20)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 ... -
Five-weight codes from three-valued correlation of M-sequences
(Journal article; Peer reviewed, 2023)In this paper, for each of six families of three-valued m-sequence correlation, we construct an infinite family of five-weight codes from trace codes over the ring R = F2 + uF2, where u2 = 0. The trace codes have the ... -
Fixed cardinality stable sets
(Journal article; Peer reviewed, 2021)Given an undirected graph G=(V,E) and a positive integer k in {1, ..., |V|}, we initiate the combinatorial study of stable sets of cardinality exactly k in G. Our aim is to instigate the polyhedral investigation of the ... -
Fixed Parameter Set Splitting, Linear Kernel and Improved Running Time
(Chapter, 2005) -
A Fixed-Parameter Perspective on #BIS
(Peer reviewed; Journal article, 2019-07-18)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, ...