Now showing items 305-324 of 543

    • Naive and adapted utilization of the GPU for general purpose computing 

      Mjøs, Alexander (Master thesis, 2017)
      In this thesis we will see that adaptive utilization of the graphical processing unit (GPU) has much better performance than naive utilization, but it takes longer time to implement and requires more knowledge about ...
    • Naturlige nettverk 

      Vatshelle, Martin (Master thesis, 2008)
      En innføring i naturlige nettverk. Vi forklarer og diskuterer begrepet naturlige nettverk og vurderer hvilke nettverk som bør kalles naturlige. Vi ser på forskjeller og likheter mellom tilfeldige, planlagte og naturlige ...
    • Network coding in Bluetooth networks 

      Stenvoll, Roger (Master thesis, 2009-10-01)
      This thesis discusses the possibility to apply network coding to a Bluetooth piconet. A protocol is proposed. This protocol is based on using deterministic linear network coding. The proposed alphabet size is binary, and ...
    • A New Generating Set Search Algorithm for Partially Separable Functions 

      Frimannslund, Lennart; Steihaug, Trond (ADVCOMP 2010 : The Fourth International Conference on Advanced Engineering Computing and Applications in Sciences, Conference object; Peer reviewed, 2010)
      A new derivative-free optimization method for unconstrained optimization of partially separable functions is presented. Using average curvature information computed from sampled function values the method generates an ...
    • New Lower Bounds on the Maximum Number of Minimal Connected Vertex Covers 

      Ryland, Ida (Master thesis, 2017-06-20)
      Graphs are important mathematical structures that are used to model many real-life problems. They can, for instance, be used to model relations between objects in a network. An important field of study in graph theory is ...
    • New Results on Minimal Triangulations 

      Villanger, Yngve (Doctoral thesis, 2006-04-25)
    • New Width Parameters of Graphs 

      Vatshelle, Martin (Doctoral thesis, 2012-09-03)
      The main focus of this thesis is on using the divide and conquer technique to efficiently solve graph problems that are in general intractable. We work in the field of parameterized algorithms, using width parameters of ...
    • Newsenhancer 

      Nerdal, Sindre Lilland (Master thesis, 2018-08-23)
      This thesis describes a web browser plugin called NewsEnhancer, which has the goal to make it more efficient to read the news. The plugin receives data from a server application, which continuously aggregates meta information ...
    • Non-Constructivity in Kan Simplicial Sets 

      Bezem, Marc; Coquand, Thierry; Parmann, Erik (Conference object; Peer reviewed, 2015)
      We give an analysis of the non-constructivity 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 ...
    • Nonlinear feedback shift registers and generating of binary de Bruijn sequences 

      Vivelid, Christian Ebne (Master thesis, 2016-11-21)
    • Norwegian e-Infrastructure for Life Sciences (NeLS) 

      Tekle, Kidane M; Gundersen, Sveinung; Klepper, Kjetil; Bongo, Lars Ailo; Raknes, Inge Alexander; Li, Xiaxi; Zhang, Wei; Andreetta, Christian; Mulugeta, Teshome Dagne; Kalaš, Matúš; Rye, Morten Beck; Hjerde, Erik; Antony Samy, Jeevan Karloss; Fornous, Ghislain; Azab, Abdulrahman; Våge, Dag Inge; Hovig, Eivind; Willassen, Nils Peder; Drabløs, Finn; Nygård, Ståle; Petersen, Kjell; Jonassen, Inge (Peer reviewed; Journal article, 2018)
      The Norwegian e-Infrastructure for Life Sciences (NeLS) has been developed by ELIXIR Norway to provide its users with a system enabling data storage, sharing, and analysis in a project-oriented fashion. The system is ...
    • A Note on Exact Algorithms for Vertex Ordering Problems on Graphs 

      Bodlaender, Hans L.; Fomin, Fedor; Koster, Arie M.C.A.; Kratsch, Dieter; Thilikos, Dimitrios M. (Peer reviewed; Journal article, 2011-01-21)
      In this note, we give a proof that several vertex ordering problems can be solved in O ∗(2 n ) time and O ∗(2 n ) space, or in O ∗(4 n ) time and polynomial space. The algorithms generalize algorithms for the Travelling ...
    • A note on some algebraic trapdoors for block ciphers 

      Calderini, Marco (Peer reviewed; Journal article, 2018)
      We provide sufficient conditions to guarantee that a translation based cipher is not vulnerable with respect to the partition-based trapdoor. This trapdoor has been introduced, recently, by Bannier et al. (2016) and it ...
    • A novel CCA attack using decryption errors against LAC 

      Guo, Qian; Johansson, Thomas; Yang, Jing (Peer reviewed; Journal article, 2019)
      Cryptosystems based on Learning with Errors or related problems are central topics in recent cryptographic research. One main witness to this is the NIST Post-Quantum Cryptography Standardization effort. Many submitted ...
    • A novel collaboration platform: Structuring books as networks 

      Steensen, Ole Eskild (Master thesis, 2018-08-21)
      Ever since Gutenberg introduced the art of printing in Europe in the mid 1400s, the way we consume and author books has remained somewhat static. In spite of several technological advances since that time, the very structure ...
    • Novice Difficulties with Language Constructs 

      Rosbach, Alexander Hoem (Master thesis, 2013-08-01)
      Programming is a difficult skill to learn, and programming courses have high dropout rates. In this thesis we study the problems that students have during their first introductory programming course at The University of ...
    • NP-scout: Machine learning approach for the quantification and visualization of the natural product-likeness of small molecules 

      Chen, Ya; Stork, Conrad; Hirte, Steffen; Kirchmair, Johannes (Peer reviewed; Journal article, 2019)
      Natural products (NPs) remain the most prolific resource for the development of small-molecule drugs. Here we report a new machine learning approach that allows the identification of natural products with high accuracy. ...
    • Obscurance-based Volume Rendering Framework 

      Ruiz, Marc; Boada, Imma; Viola, Ivan; Bruckner, Stefan; Feixas, Miquel; Sbert, Mateu (Proceedings of Volume Graphics 2008., Conference object; Peer reviewed, 2008)
      lighting effects in a faster way than global illumination. Its application in volume visualization is of special interest since it permits us to generate a high quality rendering at a low cost. In this paper, we propose ...
    • OLS Dialog: An open-source front end to the Ontology Lookup Service 

      Barsnes, Harald; Côté, Richard G.; Eidhammer, Ingvar; Martens, Lennart (Peer reviewed; Journal article, 2010-01-17)
      Background: With the growing amount of biomedical data available in public databases it has become increasingly important to annotate data in a consistent way in order to allow easy access to this rich source of information. ...