Now showing items 1-20 of 259

  • Localizing Cell Towers from Crowdsourced Measurements 

    Rusvik, Johan Alexander Nordstrand (The University of Bergen, 2015-06-01)
    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 ...
  • Exact algorithms for MAX-2SAT and MAX-3SAT via multidimensional matrix multiplication 

    Petkevich, Yevgheni (The University of Bergen, 2015-06-01)
    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 ...
  • Maximum number of edges in graph classes under degree and matching constraints 

    Måland, Erik Kvam (The University of Bergen, 2015-05-12)
    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 ...
  • Community Detection in Social Networks 

    Fasmer, Erlend Eindride (The University of Bergen, 2015-05-01)
    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 Maximum-Flow Problem with Minimum-Lot Sizes 

    Ganeshan, Vithya (The University of Bergen, 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. ...
  • Visibility-oriented Visualization Design for Flow Illustration 

    Brambilla, Andrea (The University of Bergen, 2014-12-18)
    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 

    Mindek, Peter; Gröller, Eduard; Bruckner, Stefan (Wiley, 2014-12)
    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 ...
  • Community-driven development for computational biology at Sprints, Hackathons and Codefests 

    Möller, Steffen; Afgan, Enis; Banck, Michael; Bonnal, Raoul J. P.; Booth, Timothy; Chilton, John; Cock, Peter J. A.; Gumbel, Markus; Harris, Nomi; Holland, Richard; Kalaš, Matúš; Kaján, László; Kibukawa, Eri; Powel, David R.; Prins, Pjotr; Quinn, Jacqueline; Sallou, Olivier; Strozzi, Francesco; Seemann, Torsten; Sloggett, Clare; Soiland-Reyes, Stian; Spooner, William; Steinbiss, Sascha; Tille, Andreas; Travis, Anthony J.; Guimera, Roman V.; Katayama, Toshiaki; Chapman, Brad A. (BioMed Central, 2014-11-27)
    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 

    Myrtveit, Magnar (The University of Bergen, 2014-11-20)
    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 

    Mutunge, Purity Kamene (The University of Bergen, 2014-11-19)
    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 

    Li, Nian; Li, Chunlei; Helleseth, Tor; Ding, Cunsheng; Tang, Xiaohu (Elsevier, 2014-11)
    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 three-level model fusion 

    Kolesar, Ivan; Parulek, Julius; Viola, Ivan; Bruckner, Stefan; Stavrum, Anne-Kristin; Hauser, Helwig (BioMed Central, 2014-10-14)
    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 2-disjoint connected subgraphs problem faster than 2ⁿ 

    Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michal Pawel; Wojtaszczyk, Jakub Onufry (Springer, 2014-10)
    The 2-DISJOINT 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 ...
  • Sketch-based Modelling and Conceptual Visualization of Geomorphological Processes for Interactive Scientific Communication 

    Natali, Mattia (The University of Bergen, 2014-09-19)
    Throughout this dissertation, solutions for rapid digitalization of ideas will be defined. More precisely, the focus is on interactive scientific sketching and communication of geology, where the result is a digital ...
  • Practical Aspects of the Graph Parameter Boolean-width 

    Sharmin, Sadia (The University of Bergen, 2014-08-18)
  • The Weight Distributions of Several Classes of Cyclic Codes From APN Monomials 

    Li, Chunlei; Li, Nian; Helleseth, Tor; Ding, Cunsheng (IEEE, 2014-08)
    Let m ≥ 3 be an odd integer and p be an odd prime. In this paper, a number of classes of three-weight cyclic codes C(1,e) over Fp, which have parity-check polynomial m1(x)me (x), are presented by examining general ...
  • Sequences and Linear Codes from Highly Nonlinear Functions 

    Li, Chunlei (The University of Bergen, 2014-06-16)
    Due to optimal nonlinearity and differential uniformity, perfect nonlinear (PN) and almost perfect nonlinear (APN) functions are of great importance in cryptography. It is interesting that they also define optimal objects ...
  • A polynomial-time solvable case for the NP-hard problem Cutwidth 

    Lilleeng, Simen (The University of Bergen, 2014-06-02)
    The Cutwidth problem is a notoriously hard problem, and its complexity is open on several interesting graph classes. Motivated by this fact we investigate the problem on superfragile graphs, a graph class on which the ...
  • Elastic Grid Resources using Cloud Technologies 

    Carlsen, Joachim Christoffer (The University of Bergen, 2014-06-02)
    A Large Ion Collider Experiment (ALICE) is one of four experiments at the Large Hadron Collider (LHC) at CERN. The detectors in the ALICE experiment produce data at a rate of 4 GB/s after being filtered and compressed ...
  • Software modeling of the propagation of electromagnetic beams through different media 

    Bruket, Kjetil Rørvik (The University of Bergen and Bergen University College, 2014-06-02)
    Propagation and focusing of electromagnetic beams through layered anisotropic medium is of interest in the field of optical data storage, where thin layers are mounted on glass substrates, display technology, where polarised ...