Blar i Department of Informatics på tittel
Viser treff 353372 av 630

Naive and adapted utilization of the GPU for general purpose computing
(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
(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
(Master thesis, 20091001)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 Family of APN Quadrinomials
(Journal article; Peer reviewed, 2020)The binomial B(x) = x 3 +βx 36 (where β is primitive in F 2 2) over F 2 10 is the first known example of an Almost Perfect Nonlinear (APN) function that is not CCZequivalent to a power function, and has remained unclassified ... 
A New Generating Set Search Algorithm for Partially Separable Functions
(ADVCOMP 2010 : The Fourth International Conference on Advanced Engineering Computing and Applications in Sciences, Conference object; Peer reviewed, 2010)A new derivativefree 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
(Master thesis, 20170620)Graphs are important mathematical structures that are used to model many reallife 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
(Doctoral thesis, 20060425) 
New Width Parameters of Graphs
(Doctoral thesis, 20120903)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
(Master thesis, 20180823)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 ... 
NonConstructivity in Kan Simplicial Sets
(Conference object; Peer reviewed, 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 ... 
Nonlinear feedback shift registers and generating of binary de Bruijn sequences
(Master thesis, 20161121) 
Norwegian eInfrastructure for Life Sciences (NeLS)
(Peer reviewed; Journal article, 2018)The Norwegian eInfrastructure 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 projectoriented fashion. The system is ... 
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs
(Peer reviewed; Journal article, 20110121)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
(Peer reviewed; Journal article, 2018)We provide sufficient conditions to guarantee that a translation based cipher is not vulnerable with respect to the partitionbased trapdoor. This trapdoor has been introduced, recently, by Bannier et al. (2016) and it ... 
A novel CCA attack using decryption errors against LAC
(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 PostQuantum Cryptography Standardization effort. Many submitted ... 
A novel collaboration platform: Structuring books as networks
(Master thesis, 20180821)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
(Master thesis, 20130801)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 ... 
NPscout: Machine learning approach for the quantification and visualization of the natural productlikeness of small molecules
(Peer reviewed; Journal article, 2019)Natural products (NPs) remain the most prolific resource for the development of smallmolecule drugs. Here we report a new machine learning approach that allows the identification of natural products with high accuracy. ... 
Nye øvre skranker på ytelsen til adaptiv koding og modulasjon i OFDMba serte trådløse nettverk
(Master thesis, 2004) 
Obscurancebased Volume Rendering Framework
(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 ...