Department of Informatics: Nye registreringer
Viser treff 161-180 av 1130
-
Gold functions and switched cube functions are not 0-extendable in dimension n > 5
(Journal article; Peer reviewed, 2023)In the independent works by Kalgin and Idrisova and by Beierle, Leander and Perrin, it was observed that the Gold APN functions over \(\mathbb {F}_{2^5}\) give rise to a quadratic APN function in dimension 6 having maximum ... -
On the Satisfiability of Smooth Grid CSPs
(Journal article; Peer reviewed, 2022)Many important NP-hard problems, arising in a wide variety of contexts, can be reduced straightforwardly to the satisfiability problem for CSPs whose underlying graph is a grid. In this work, we push forward the study of ... -
Loop-checking and the uniform word problem for join-semilattices with an inflationary endomorphism
(Journal article; Peer reviewed, 2022)We solve in polynomial time two decision problems that occur in type checking when typings depend on universe level constraints. -
The Legendre Symbol and the Modulo-2 Operator in Symmetric Schemes over Fnp: Preimage Attack on Full Grendel
(Journal article; Peer reviewed, 2022)Motivated by modern cryptographic use cases such as multi-party computation (MPC), homomorphic encryption (HE), and zero-knowledge (ZK) protocols, several symmetric schemes that are efficient in these scenarios have recently ... -
Second-Order Finite Automata
(Journal article; Peer reviewed, 2022)Traditionally, finite automata theory has been used as a framework for the representation of possibly infinite sets of strings. In this work, we introduce the notion of second-order finite automata, a formalism that combines ... -
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width
(Journal article; Peer reviewed, 2022)The two weighted graph problems Node Multiway Cut (NMC) and Subset Feedback Vertex Set (SFVS) both ask for a vertex set of minimum total weight, that for NMC disconnects a given set of terminals, and for SFVS intersects ... -
Acyclic, star, and injective colouring: bounding the diameter∗
(Journal article; Peer reviewed, 2022)We examine the effect of bounding the diameter for a number of natural and well-studied variants of the COLOURING problem. A colouring is acyclic, star, or injective if any two colour classes induce a forest, star forest ... -
Resolute control: Forbidding candidates from winning an election is hard
(Journal article; Peer reviewed, 2022) -
Simplicity conditions for binary orthogonal arrays
(Journal article; Peer reviewed, 2023)It is known that correlation-immune (CI) Boolean functions used in the framework of side channel attacks need to have low Hamming weights. The supports of CI functions are (equivalently) simple orthogonal arrays, when their ... -
Learning Possibilistic Logic Theories
(Doctoral thesis, 2023-03-15)Vi tar opp problemet med å lære tolkbare maskinlæringsmodeller fra usikker og manglende informasjon. Vi utvikler først en ny dyplæringsarkitektur, RIDDLE: Rule InDuction with Deep LEarning (regelinduksjon med dyp læring), ... -
Interactive Visual Analysis of Structure-borne Noise Data
(Journal article; Peer reviewed, 2023)Numerical simulation has become omnipresent in the automotive domain, posing new challenges such as high-dimensional parameter spaces and large as well as incomplete and multi-faceted data. In this design study, we show ... -
sMolBoxes: Dataflow Model for Molecular Dynamics Exploration
(Journal article; Peer reviewed, 2023)We present sMolBoxes, a dataflow representation for the exploration and analysis of long molecular dynamics (MD) simulations. When MD simulations reach millions of snapshots, a frame-by-frame observation is not feasible ... -
Extracting Rules from Neural Networks with Partial Interpretations
(Journal article; Peer reviewed, 2022)We investigate the problem of extracting rules, expressed in Horn logic, from neural network models. Our work is based on the exact learning model, in which a learner interacts with a teacher (the neural network model) via ... -
Galaxy: A Decade of Realising CWFR Concepts
(Journal article; Peer reviewed, 2022)Despite recent encouragement to follow the FAIR principles, the day-to-day research practices have not changed substantially. Due to new developments and the increasing pressure to apply best practices, initiatives to ... -
I Can See Clearly Now: Clairvoyant Assertions for Deadlock Checking
(Journal article; Peer reviewed, 2022)Static analysers are traditionally used to check various correctness properties of software. In the face of refactorings that can have adverse effects on correctness, developers need to analyse the code after refactoring ... -
MuSIC: Multi-Sequential Interactive Co-Registration for Cancer Imaging Data based on Segmentation Masks
(Journal article; Peer reviewed, 2022)In gynecologic cancer imaging, multiple magnetic resonance imaging (MRI) sequences are acquired per patient to reveal different tissue characteristics. However, after image acquisition, the anatomical structures can be ... -
Non-Uniform k-Center and Greedy Clustering
(Journal article; Peer reviewed, 2022)In the Non-Uniform k-Center (NUkC) problem, a generalization of the famous k-center clustering problem, we want to cover the given set of points in a metric space by finding a placement of balls with specified radii. In ... -
Extensions in graph normal form
(Journal article; Peer reviewed, 2022)Graph normal form, introduced earlier for propositional logic, is shown to be a normal form also for first-order logic. It allows to view syntax of theories as digraphs, while their semantics as kernels of these digraphs. ... -
Encoding and decoding of several optimal rank metric codes
(Journal article; Peer reviewed, 2022)This paper presents encoding and decoding algorithms for several families of optimal rank metric codes whose codes are in restricted forms of symmetric, alternating and Hermitian matrices. First, we show the evaluation ... -
On Two Fundamental Problems on APN Power Functions
(Journal article; Peer reviewed, 2022)The six infinite families of power APN functions are among the oldest known instances of APN functions, and it has been conjectured in 2000 that they exhaust all possible power APN functions. Another long-standing open ...