Blar i Department of Informatics på tittel
Viser treff 544-563 av 1118
-
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, 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 ... -
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 ... -
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. -
Loss-function learning for cell type mapping of spatial transcriptomics using single-cell RNA-seq data
(Master thesis, 2023-06-01)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 Same-Size Clustering
(Journal article; Peer reviewed, 2023)In this work, we study the k-median clustering problem with an additional equal-size constraint on the clusters from the perspective of parameterized preprocessing. Our main result is the first lossy (2-approximate) ... -
Low-Rank Binary Matrix Approximation in Column-Sum Norm
(Journal article; Peer reviewed, 2020)We consider 𝓁₁-Rank-r 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 column-sum norm ‖ 𝐀 -𝐁‖₁. We show ... -
Lower bounds on the size of spheres of permutations under the Chebychev distance
(Peer reviewed; Journal article, 2010)Lower bounds on the number of permutations p of {1, 2, . . . , n} satisfying |pi − i| ≤ d for all i are given -
Machine learning and electronic health records
(Master thesis, 2020-10-02)In this work, we investigate the benefits and complications of using machine learning on EHR data. We survey some recent literature and conduct experiments on real data collected from hospital EHR systems. -
Machine Learning Approaches for Biomarker Discovery Using Gene Expression Data
(Chapter, 2021)Biomarkers are of great importance in many fields, such as cancer research, toxicology, diagnosis and treatment of diseases, and to better understand biological response mechanisms to internal or external intervention. ...