Browsing Department of Informatics by Issue Date
Now showing items 2140 of 311

Skaping av meirverdi gjennom opne data om kollektivtrafikk
(The University of Bergen, 20150504)Tema i denne oppgåva er opne data, med ei avgrensing mot kollektivtrafikkdata. Djupnestudien er retta mot verksemda til Skyss, det fylkeskommunale kollektivtrafikkselskapet i Hordaland. Omgrepet opne data" inneber ...Master thesis 
Community Detection in Social Networks
(The University of Bergen, 20150501)Social networks usually display a hierarchy of communities and it is the task of community detection algorithms to detect these communities and preferably also their hierarchical relationships. One common class of ...Master thesis 
Efficient CRISPRCas9mediated generation of knockin human pluripotent stem cells lacking undesired mutations at the targeted locus
(Elsevier, 201505)The CRISPRCas9 system has the potential to revolutionize genome editing in human pluripotent stem cells (hPSCs), but its advantages and pitfalls are still poorly understood. We systematically tested the ability of CRISPRCas9 ...Journal article 
Fast Method for MaximumFlow Problem with MinimumLot Sizes
(The University of Bergen, 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. ...Master thesis 
Axis patterning by BMPs: cnidarian network reveals evolutionary constraints
(Elsevier, 201503)BMP signaling plays a crucial role in the establishment of the dorsoventral body axis in bilaterally symmetric animals. However, the topologies of the bone morphogenetic protein (BMP) signaling networks vary drastically ...Journal article 
Fast biclustering by dual parameterization
(Dagstuhl Publishing, 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 ...Conference object 
Investigating Streamless Sets
(Dagstuhl Publishing, 2015)In this paper we look at streamless sets, recently investigated by Coquand and Spiwack. A set is streamless if every stream over that set contain a duplicate. It is an open question in constructive mathematics whether the ...Conference object 
NonConstructivity in Kan Simplicial Sets
(Dagstuhl Publishing, 2015)We give an analysis of the nonconstructivity of the following basic result: if X and Y are simplicial sets and Y has the Kan extension property, then Y X also has the Kan extension property. By means of Kripke countermodels ...Conference object 
Bchromatic number: Beyond NPhardness
(Dagstuhl Publishing, 2015)The bchromatic number of a graph G, chi_b(G), is the largest integer k such that G has a kvertex coloring with the property that each color class has a vertex which is adjacent to at least one vertex in each of the other ...Conference object 
Quick but odd growth of cacti
(Dagstuhl Publishing, 2015)Let F be a family of graphs. Given an input graph G and a positive integer k, testing whether G has a ksized subset of vertices S, such that G\S belongs to F, is a prototype vertex deletion problem. These type of problems ...Conference object 
Parameterized complexity of secluded connectivity problems
(Dagstuhl Publishing, 2015)The Secluded Path problem introduced by Chechik et al. in [ESA 2013] models a situation where a sensitive information has to be transmitted between a pair of nodes along a path in a network. The measure of the quality of ...Conference object 
Finding even subgraphs even faster
(Dagstuhl Publishing, 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 ...Conference object 
Maximum matching width: New characterizations and a fast algorithm for dominating set
(Dagstuhl Publishing, 2015)We give alternative definitions for maximum matching width, e.g., a graph G has mmw(G) <= k if and only if it is a subgraph of a chordal graph H and for every maximal clique X of H there exists A,B,C \subseteq X with A ...Conference object 
Variants of plane diameter completion
(Dagstuhl Publishing, 2015)The Plane Diameter Completion problem asks, given a plane graph G and a positive integer d, if it is a spanning subgraph of a plane graph H that has diameter at most d. We examine two variants of this problem where the ...Conference object 
Enumerating minimal connected dominating sets in graphs of bounded chordality
(Dagstuhl Publishing, 2015)Listing, generating or enumerating objects of specified type is one of the principal tasks in algorithmics. In graph algorithms one often enumerates vertex subsets satisfying a certain property. We study the enumeration ...Conference object 
Visibilityoriented Visualization Design for Flow Illustration
(The University of Bergen, 20141218)Flow phenomena are ubiquitous in our world and they affect many aspects of our daily life. For this reason, they are the subject of extensive studies in several research fields. In medicine, the blood flow through our ...Doctoral thesis 
Managing spatial selections with contextual snapshots
(Wiley, 201412)Spatial selections are a ubiquitous concept in visualization. By localizing particular features, they can be analysed and compared in different views. However, the semantics of such selections often depend on specific ...Journal article 
Communitydriven development for computational biology at Sprints, Hackathons and Codefests
(BioMed Central, 20141127)Background: Computational biology comprises a wide range of technologies and approaches. Multiple technologies can be combined to create more powerful workflows if the individuals contributing the data or providing tools ...Journal article 
Scaling the scales  A suggested improvement to IBM's Intelligent Recommendation Algorithm
(The University of Bergen, 20141120)Recommender systems appear in a large variety of applications, and their use has become very common in recent years. As a lot of money can be made by companies having a better recommender system than their competitors, ...Master thesis 
The index tracking problem with a limit on portfolio size
(The University of Bergen, 20141119)For a passive fund manager tracking a benchmark, it is not uncommon to select some, and not all the assets in the index to his portfolio. In this thesis, we consider the problem of minimizing the tracking error under the ...Master thesis