Samlinger i dette delarkivet

Nye registreringer

  • Treewidth is NP-Complete on Cubic Graphs 

    Bodlaender, Hans L.; Bonnet, Édouard; Jaffke, Lars; Knop, Dusan; Lima, Paloma Thome de; Milanič, Martin; Ordyniak, Sebastian; Pandey, Sukanya; Suchy, Ondrey (Journal article; Peer reviewed, 2023)
    In this paper, we show that Treewidth is NP-complete for cubic graphs, thereby improving the result by Bodlaender and Thilikos from 1997 that Treewidth is NP-complete on graphs with maximum degree at most 9. We add a new ...
  • Guarding the First Order: The Rise of AES Maskings 

    Askeland, Amund; Dhooghe, S.; Petkova-Nikova, Svetla Iordanova; Rijmen, Vincent Stefaan; Zhang, Zhenda (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 ...
  • Fine-grained parameterized complexity analysis of graph coloring problems 

    Jaffke, Lars; Jansen, Bart Maarten Paul (Journal article; Peer reviewed, 2023)
    The q-Coloring problem asks whether the vertices of a graph can be properly colored with q colors. In this paper we perform a fine-grained analysis of the complexity of q- Coloring with respect to a hierarchy of structural ...
  • b-Coloring Parameterized by Clique-Width 

    Jaffke, Lars; Lima, Paloma T.; Lokshtanov, Daniel (Journal article; Peer reviewed, 2023)
    We provide a polynomial-time algorithm for b- Coloring on graphs of constant clique-width. This unifies and extends nearly all previously known polynomial time results on graph classes, and answers open questions posed by ...
  • λ' is Confluent 

    Passeniouk, Yan (Master thesis, 2023-11-20)
    The λ-calculus is a well-known model of computation, characterised by its simplicity and adapted for the implementation of functional programming languages. We present an extension of the λ-calculus proposed by ...
  • Algebraic Attacks on the Encryption Scheme HADESMiMC 

    Ellingsen, Tor Kristian (Master thesis, 2023-11-20)
    HADESMiMC is a recent symmetric cryptographic algorithm working with elements in a finite field. It is proposed as a candidate cipher for secure data transfers using Multiparty Computation (MPC). MPC is particularly useful ...
  • Chatbot Generation for Open Data Accessibility 

    Heldal, Julie Marie Schnell; Hermansen, Kathrine (Master thesis, 2023-11-20)
    Open data, despite its availability, often remains inaccessible to the average person due to complex data formats and technical barriers. This challenge hinders the realization of open data’s transformative potential. ...
  • Exploration of Linear-Algebra Graph Algorithms on the Graphcore IPU 

    Otten, Yoeri Daniel (Master thesis, 2023-11-20)
    More specialized hardware is being created to improve the efficiency of demanding algorithms. Graphcore introduced their Intelligence processors: a specialized true MIMD architecture which specializes in machine learning ...
  • Deep Learning and Deep Reinforcement Learning for Graph Based Applications 

    Hasibi, Ramin (Doctoral thesis, 2024-01-26)
    Dyp læring har gitt state-of-the-art ytelse i mange applikasjoner som datasyn, tekstanalyse, biologi, osv. Suksessen med dyp læring har også hjulpet fremveksten av dyp forsterkende læring for optimal beslutningstaking og ...
  • On self-equivalences of APN functions 

    Jensløkken, Vegard (Master thesis, 2023-10-16)
    In this thesis we investigate the structure of what we call extended linear self-equivalences for vectorial Boolean functions. That is, $(L_1, L_2, L)$ such that $L_1 \circ F \circ L_2 + L = F$ for some vectorial Boolean ...
  • Macrophage phenotype transitions in a stochastic gene-regulatory network model 

    Frank, Anna-Simone Josefine; Larripa, Kamila; Ryu, Hwayeon; Röblitz, Susanna (Journal article; Peer reviewed, 2023)
    Polarization is the process by which a macrophage cell commits to a phenotype based on external signal stimulation. To know how this process is affected by random fluctuations and events within a cell is of utmost importance ...
  • Integrating Wearable Technology for Enhanced Self-Assessment in Mental Health 

    Johansen, Petter (Master thesis, 2023-10-16)
    Mental health is a critical aspect of overall well-being and affects a large proportion of the world’s population. The first step of identifying possible issues in an individual is often using assessment method such as ...
  • Topological Regularization of Support Vector Machines 

    Schooltink, Willem Theodorus (Master thesis, 2023-11-21)
    The unique functioning of Support Vector Machines (SVMs) can create undesirable behaviour, however this unique functioning in turn also allow for exploration of novel topological regularization methods. SVMs are a common ...
  • Polyhedra and algorithms for problems bridging notions of connectivity and independence 

    Samer, Phillippe (Doctoral thesis, 2023-12-21)
    I denne avhandlinga interesserer vi oss for å finne delgrafer som svarer til utvalgte modeller for begrepene sammenheng og uavhengighet. I korthet betyr dette stabile (også kalt uavhengige) mengder med gitt kardinalitet, ...
  • Causal inference in drug discovery and development 

    Michoel, Tom; Zhang, Jitao David (Journal article; Peer reviewed, 2023)
    To discover new drugs is to seek and to prove causality. As an emerging approach leveraging human knowledge and creativity, data, and machine intelligence, causal inference holds the promise of reducing cognitive bias and ...
  • Multivariate Analysis of Clustering Problems with Constraints 

    Purohit, Nidhi (Doctoral thesis, 2023-12-14)
  • Cryptology in the Crowd 

    Heum, Hans Waardal (Doctoral thesis, 2023-12-08)
    Uhell skjer: Kanskje mistet du nøkkelen til huset, eller hadde PIN-koden til innbruddsalarmen skrevet på en dårlig plassert post-it lapp. Og kanskje endte de slik opp i hendene på feil person, som nå kan påføre livet ditt ...
  • A Computational Search for Cubic-Like Bent Functions 

    Snorrason, Jakob (Master thesis, 2023-10-02)
    Boolean functions are a central topic in computer science. A subset of Boolean functions, Bent Boolean functions, provide optimal resistance to various cryptographical attack vectors, making them an interesting subject for ...
  • Gaussian Likelihoods in Bayesian Neural Networks 

    Hønsi, Alvar (Master thesis, 2023-10-02)
    Bayesian neural networks (BNNs) offer a promising probabilistic take on neural networks, allowing uncertainty quantification in both model predictions and parameters. Being a relatively new and evolving field of research, ...
  • Balancing the Game: Comparative Analysis of Single Heuristics and Adaptive Heuristic Approaches for Sports Scheduling Problem 

    Alesahebfosoul, Seyed Erfan (Master thesis, 2023-10-02)
    Sport timetabling problems are Combinatorial Optimization problems which involve the creation of schedules that determine when and where teams compete against each other. One specific type of sports scheduling, the double ...

Vis flere