Blar i Department of Informatics på tittel
Viser treff 442-461 av 1130
-
Grein. A New Non-Linear Cryptoprimitive
(Master thesis, 2013-12-10)In this thesis, we will study a new stream cipher, Grein, and a new cryptoprimitive used in this cipher. The second chapter gives a brief introduction to cryptography in general. The third chapter looks at stream ciphers ... -
Guaranteeing Resource Bounds for Component Software
(Journal article, 2005-06-15)Component software is software that has been assembled from various pieces of standardized, reusable computer programs, so-called components. Executing component software creates instances of these components. For several ... -
Guarding the First Order: The Rise of AES Maskings
(Journal article; Peer reviewed, 2023)We provide three first-order hardware maskings of the AES, each allowing for a different trade-off between the number of shares and the number of register stages. All maskings use a generalization of the changing of the ... -
Hard Mathematical Problems in Cryptography and Coding Theory
(Doctoral thesis, 2020-04-28)In this thesis, we are concerned with certain interesting computationally hard problems and the complexities of their associated algorithms. All of these problems share a common feature in that they all arise from, or have ... -
Hardness of Non-trivial Generalized Domination Problems Parameterized by Linear Mim-Width
(Master thesis, 2022-06-01) -
Hardware architecture of Dillon's APN permutation for different primitive polynomials
(Journal article; Peer reviewed, 2023)Cryptographically strong functions used as S-boxes in block cyphers are fundamental for the cypher’s security. Their representation as lookup tables is possible for functions of small dimension. For larger dimensions, this ... -
Hash functions in Cryptography
(Master thesis, 2008)This thesis is concerned with giving both an overview of the application of hash functions in cryptography and a presentation of today's standard cryptographic hash functions. Cryptographic hash functions are a valuable ... -
Hashfunksjoner for bruk i Digitale Signaturer
(Master thesis, 1995) -
Hierarchical clusterings of unweighted graphs
(Journal article; Peer reviewed, 2020)We study the complexity of finding an optimal hierarchical clustering of an unweighted similarity graph under the recently introduced Dasgupta objective function. We introduce a proof technique, called the normalization ... -
A Hierarchical Splitting Scheme to Reveal Insight into Highly Self-Occluded Integral Surfaces
(Peer reviewed; Journal article, 2012)In flow visualization, integral surfaces are of particular interest for their ability to describe trajectories of massless particles. In areas of swirling motion, integral surfaces can become very complex and difficult to ... -
High-Dimensional Bayesian Network Inference From Systems Genetics Data Using Genetic Node Ordering
(Journal article; Peer reviewed, 2019)Studying the impact of genetic variation on gene regulatory networks is essential to understand the biological mechanisms by which genetic variation causes variation in phenotypes. Bayesian networks provide an elegant ... -
High-performance design patterns for modern Fortran
(Peer reviewed; Journal article, 2015)This paper presents ideas for using coordinate-free numerics in modern Fortran to achieve code flexibility in the partial differential equation (PDE) domain. We also show how Fortran, over the last few decades, has changed ... -
High-Resolution Mapping of Forest Structure From SAR and Optical Satellite Imagery Using Deep Learning
(Master thesis, 2022-11-21) -
Highlights from the Eighth International Society for Computational Biology (ISCB) Student Council Symposium 2012
(Peer reviewed; Journal article, 2012-12-14)Abstract The report summarizes the scientific content of the annual symposium organized by the Student Council of the International Society for Computational Biology (ISCB) held in conjunction with the Intelligent Systems ... -
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
(Journal article; Peer reviewed, 2020)For a finite collection of graphs F, the F-TM-Deletion problem has as input an n-vertex graph G and an integer k and asks whether there exists a set S ⊆ V(G) with |S| ≤ k such that G \ S does not contain any of the graphs ... -
Honeycomb Plots: Visual Enhancements for Hexagonal Maps
(Chapter, 2022)Aggregation through binning is a commonly used technique for visualizing large, dense, and overplotted two-dimensional data sets. However, aggregation can hide nuanced data-distribution features and complicates the display ... -
Hormonal regulation of ovarian follicle growth in humans: Model-based exploration of cycle variability and parameter sensitivities
(Journal article; Peer reviewed, 2022)We present a modelling and simulation framework for the dynamics of ovarian follicles and key hormones along the hypothalamic-pituitary–gonadal axis throughout consecutive human menstrual cycles. All simulation results ... -
How to cope with incorrect HTML
(Master thesis, 2001) -
How to find a good explanation for clustering?
(Journal article; Peer reviewed, 2023)k-means and k-median clustering are powerful unsupervised machine learning techniques. However, due to complicated dependencies on all the features, it is challenging to interpret the resulting cluster assignments. Moshkovitz, ... -
How to provide automated feedback helping students with negative semantic transfer when learning a second programming language
(Master thesis, 2022-06-01)Earlier studies have shown that when students see matching syntax across programming languages, they believe the semantics will match. Typically this is true, but occasionally the syntax between two languages is similar ...