Browsing Department of Informatics by Issue Date
Now showing items 120 of 268

Choice of parameter for DPbased FPT algorithms: four case studies
(The University of Bergen, 20150907)This thesis studies dynamic programming algorithms and structural parameters used when solving computationally hard problems. In particular, we look at algorithms that make use of structural decompositions to overcome ... 
Localizing Cell Towers from Crowdsourced Measurements
(The University of Bergen, 20150601)Today, several internet sites exist that aim to provide the locations and number of cellular network antennas worldwide. For example [1],[2] and [3]. What makes this task difficult to accomplish is the lack of information ... 
A Survey of LinearProgramming Guided Branching Parameterized Algorithms for Vertex Cover, with Experimental Results
(The University of Bergen, 20150601)A survey of FPT algorithms for Vertex Cover, parameterized by an above guarantee parameter. 
Exact algorithms for MAX2SAT and MAX3SAT via multidimensional matrix multiplication
(The University of Bergen, 20150601)In this thesis it is showed how an $O(n^{4\epsilon})$ algorithm for the cube multiplication problem (that is defined in the thesis) would imply a faster than naive $O^{*}(2^{n(1\frac{\epsilon}{4})})$ algorithm for the ... 
Projective Simulation compared to reinforcement learning
(The University of Bergen, 20150601)This thesis explores the model of projective simulation (PS), a novel approach for an artificial intelligence (AI) agent. The model of PS learns by interacting with the environment it is situated in, and allows for ... 
Maximum number of objects in graph classes.
(The University of Bergen, 20150531)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 ... 
SMS OneTime Passwords, Security in TwoFactor Authentication
(The University of Bergen, 20150529)In the past decade, the low price and ease of generating and sending large amounts of SMS have made it possible for many online services to create strong and affordable authentication systems. With the growth of smartphones ... 
Implementasjon av attributtbasert tilgangskontroll i elektroniske helsesystemer
(The University of Bergen, 20150528)Tilgangskontroll er et av de viktigste temaene innenfor informasjonssikkerhet[10]. Sensitiv data bør bare kunne aksesseres av autoriserte brukere eller programmer. Denne oppgaven har som hovedmål å undersøke den nåværende ... 
Maximum number of edges in graph classes under degree and matching constraints
(The University of Bergen, 20150512)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 ... 
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 ... 
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 ... 
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. ... 
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 ... 
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 ... 
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 ... 
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, ... 
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 ... 
Optimal ternary cyclic codes with minimum distance four and five
(Elsevier, 201411)Cyclic codes are an important subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics. In this paper, two families of optimal ternary cyclic codes are ... 
Interactively illustrating polymerization using threelevel model fusion
(BioMed Central, 20141014)Background: Research in cell biology is steadily contributing new knowledge about many aspects of physiological processes, both with respect to the involved molecular structures as well as their related function. Illustrations ... 
Solving the 2disjoint connected subgraphs problem faster than 2ⁿ
(Springer, 201410)The 2DISJOINT CONNECTED SUBGRAPHS problem, given a graph along with two disjoint sets of terminals Z1,Z2, asks whether it is possible to find disjoint sets A1,A2, such that Z1 ⊆ A1, Z2 ⊆ A2 and A1,A2 induce connected ...