Blar i Department of Informatics på tittel
Viser treff 585-604 av 1199
-
Learning from positive and negative examples: New proof for binary alphabets
(Journal article; Peer reviewed, 2024)One of the most fundamental problems in computational learning theory is the problem of learning a finite automaton A consistent with a finite set P of positive examples and with a finite set N of negative examples. By ... -
Learning Horn envelopes via queries from language models
(Journal article; Peer reviewed, 2024)We present an approach for systematically probing a trained neural network to extract a symbolic abstraction of it, represented as a Boolean formula. We formulate this task within Angluin's exact learning framework, where ... -
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), ... -
Least Surprising Dataflows in Constraint Based Graphical User Interfaces
(Master thesis, 2024-06-10)There are many approaches for implementing Graphical User Interfaces (GUI) since programming GUIs is a difficult and complex task. This thesis focuses on a prticular GUI development approach, one based on multi-way dataflow ... -
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 ... -
Lex M versus MCS-M
(Journal article; Peer reviewed, 2006) -
Line Harp: Importance-Driven Sonification for Dense Line Charts
(Master thesis, 2023-06-01) -
Linear dependencies between non-uniform distributions in DES
(Master thesis, 2014-05-30)Davies and Murphy explained some non-uniform distributions of the output from pairs and triplets of S-boxes in DES, and how they are completely dependent on some key bits. There are linear dependencies between these ... -
Lineær kompleksitet til produkter av maksimalsekvenser
(Master thesis, 2000) -
Liquid Conductor: Animated Transitions Across Dimensions
(Master thesis, 2023-06-21)This thesis explores the power of visualization in conveying complex data through intuitive visual representations. It investigates the effectiveness of animated transitions in understanding correlations between different ... -
Living without Beth and Craig: Definitions and Interpolants in Description and Modal Logics with Nominals and Role Inclusions
(Journal article; Peer reviewed, 2023)The Craig interpolation property (CIP) states that an interpolant for an implication exists iff it is valid. The projective Beth definability property (PBDP) states that an explicit definition exists iff a formula stating ... -
Localizing Cell Towers from Crowdsourced Measurements
(Master thesis, 2015-06-01)Today, several internet sites exist that aim to provide the locations and number of cellular network antennas worldwide. For example [1],[2] and [3]. What makes this task difficult to accomplish is the lack of information ... -
Locally Abstract, Globally Concrete Semantics of Concurrent Programming Languages
(Journal article; Peer reviewed, 2024)Formal, mathematically rigorous programming language semantics are the essential prerequisite for the design of logics and calculi that permit automated reasoning about concurrent programs. We propose a novel modular ... -
Logics of Statements in Context-Category Independent Basics
(Journal article; Peer reviewed, 2022)Based on a formalization of open formulas as statements in context, the paper presents a freshly new and abstract view of logics and specification formalisms. Generalizing concepts like sets of generators in Group Theory, ... -
Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms
(Journal article; Peer reviewed, 2022)We discuss recent algorithmic extensions of two classic results of extremal combinatorics about long paths in graphs. First, the theorem of Dirac from 1952 asserts that a 2-connected graph G with the minimum vertex degree ... -
Long-read single-molecule RNA structure sequencing using nanopore
(Journal article; Peer reviewed, 2022)RNA molecules can form secondary and tertiary structures that can regulate their localization and function. Using enzymatic or chemical probing together with high-throughput sequencing, secondary structure can be mapped ... -
Longest Cycle Above Erdös-Gallai Bound
(Journal article; Peer reviewed, 2022)In 1959, Erdős and Gallai proved that every graph G with average vertex degree ad(G) ≥ 2 contains a cycle of length at least ad(G). We provide an algorithm that for k ≥ 0 in time 2^𝒪(k)⋅n^𝒪(1) decides whether a 2-connected ... -
Longitudinal visualization for exploratory analysis of multiple sclerosis lesions
(Journal article; Peer reviewed, 2022)In multiple sclerosis (MS), the amount of brain damage, anatomical location, shape, and changes are important aspects that help medical researchers and clinicians to understand the temporal patterns of the disease. Interactive ... -
Looking at the Stars
(Journal article, 2006-02-28)The problem of packing k vertex-disjoint copies of a graph H into another graph G is NP-complete if H has more than two vertices in some connected component. In the framework of parameterized complexity we analyze a ... -
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.