Blar i Department of Informatics på tittel
Viser treff 433452 av 927

The Lagrangian, constraint qualifications and economics
(Journal article; Peer reviewed, 2022)Considering constrained choice, practitioners and theorists frequently invoke a Lagrangian to generate optimality conditions. Regular use of that vehicle requires, however, some constraint qualification. Yet many economists ... 
Largest chordal and interval subgraphs faster than 2n
(Peer reviewed; Journal article, 20150822)We prove that in a graph with n vertices, induced chordal and interval subgraphs with the maximum number of vertices can be found in time O(2λn) for some λ< 1. These are the first algorithms breaking the trivial 2nnO(1) ... 
Learning Description Logic Ontologies: Five Approaches. Where Do They Stand?
(Journal article; Peer reviewed, 2020)The quest for acquiring a formal representation of the knowledge of a domain of interest has attracted researchers with various backgrounds into a diverse field called ontology learning. We highlight classical machine ... 
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 Possibilistic Logic Theories
(Doctoral thesis, 20230315)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), ... 
The Legendre Symbol and the Modulo2 Operator in Symmetric Schemes over Fnp: Preimage Attack on Full Grendel
(Journal article; Peer reviewed, 2022)Motivated by modern cryptographic use cases such as multiparty computation (MPC), homomorphic encryption (HE), and zeroknowledge (ZK) protocols, several symmetric schemes that are efficient in these scenarios have recently ... 
Lex M versus MCSM
(Journal article, 2006) 
Linear dependencies between nonuniform distributions in DES
(Master thesis, 20140530)Davies and Murphy explained some nonuniform distributions of the output from pairs and triplets of Sboxes 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) 
Localizing Cell Towers from Crowdsourced Measurements
(Master thesis, 20150601)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 ... 
Logics of Statements in ContextCategory 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 2connected graph G with the minimum vertex degree ... 
Longread singlemolecule 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 highthroughput sequencing, secondary structure can be mapped ... 
Longest Cycle Above ErdösGallai 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 2connected ... 
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, 20060228)The problem of packing k vertexdisjoint copies of a graph H into another graph G is NPcomplete if H has more than two vertices in some connected component. In the framework of parameterized complexity we analyze a ... 
Loopchecking and the uniform word problem for joinsemilattices 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. 
Lossfunction learning for cell type mapping of spatial transcriptomics using singlecell RNAseq data
(Master thesis, 20230601)Breast cancers are complex cellular ecosystems consisting of multiple cell types. Heterotypic interactions and their unique gene expression profiles play central roles in cancer progression and response to therapy. However, ... 
Lossy Kernelization of SameSize Clustering
(Journal article; Peer reviewed, 2023)In this work, we study the kmedian clustering problem with an additional equalsize constraint on the clusters from the perspective of parameterized preprocessing. Our main result is the first lossy (2approximate) ... 
LowRank Binary Matrix Approximation in ColumnSum Norm
(Journal article; Peer reviewed, 2020)We consider 𝓁₁Rankr Approximation over {GF}(2), where for a binary m× n matrix 𝐀 and a positive integer constant r, one seeks a binary matrix 𝐁 of rank at most r, minimizing the columnsum norm ‖ 𝐀 𝐁‖₁. We show ...