Blar i Department of Informatics på tittel
Viser treff 576-595 av 903
-
On the IND-CCA1 Security of FHE Schemes
(Journal article; Peer reviewed, 2022)Fully homomorphic encryption (FHE) is a powerful tool in cryptography that allows one to perform arbitrary computations on encrypted material without having to decrypt it first. There are numerous FHE schemes, all of which ... -
On the maximum number of edges in planar graphs of bounded degree and matching number
(Journal article; Peer reviewed, 2023)We determine the maximum number of edges that a planar graph can have as a function of its maximum degree and matching number. -
On the parameterized complexity of deletion to H-free strong components
(Journal article; Peer reviewed, 2020)Directed Feedback Vertex Set (DFVS) is a fundamental computational problem that has received extensive attention in parameterized complexity. In this paper, we initiate the study of a wide generalization, the H-SCC Deletion ... -
On the Parameterized Complexity of the Expected Coverage Problem
(Journal article; Peer reviewed, 2022)The MAXIMUM COVERING LOCATION PROBLEM (MCLP) is a well-studied problem in the field of operations research. Given a network with positive or negative demands on the nodes, a positive integer k, the MCLP seeks to find k ... -
On the Privacy of Two Tag Ownership Transfer Protocols for RFIDs
(Chapter, 2011)In this paper, the privacy of two recent RFID tag ownership transfer protocols are investigated against the tag owners as adversaries. The first protocol called ROTIV is a scheme which provides a privacy-preserving ownership ... -
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 ... -
On the Security of Non-Linear HB (NLHB) Protocol Against Passive Attack
(Conference lecture, 2012)As a variant of the HB authentication protocol for RFID systems, which relies on the complexity of decoding linear codes against passive attacks, Madhavan et al. presented Non-Linear HB(NLHB) protocol. In contrast to HB, ... -
On the Significance of Distance in Machine Learning
(Doctoral thesis, 2023-10-23)Avstandsbegrepet er grunnleggende i maskinlæring. Hvordan vi velger å måle avstand har betydning, men det er ofte utfordrende å finne et passende avstandsmål. Metrisk læring kan brukes til å lære funksjoner som implementerer ... -
On the Sombor characteristic polynomial and Sombor energy of a graph
(Journal article; Peer reviewed, 2022)Let G be a simple graph with vertex set V(G)={v1,v2,…,vn}. The Sombor matrix of G, denoted by ASO(G), is defined as the n×n matrix whose (i, j)-entry is d2i+d2j−−−−−−√ if vi and vj are adjacent and 0 for another cases. Let ... -
On the strong dominating sets of graphs
(Journal article, 2023) -
On the Tractability of Optimization Problems on H-Graphs
(Journal article; Peer reviewed, 2020)For a graph H, a graph G is an H-graph if it is an intersection graph of connected subgraphs of some subdivision of H. H-graphs naturally generalize several important graph classes like interval graphs or circular-arc ... -
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 ... -
On width measures and topological problems on semi-complete digraphs
(Peer reviewed; Journal article, 2019)The topological theory for semi-complete digraphs, pioneered by Chudnovsky, Fradkin, Kim, Scott, and Seymour [10], [11], [12], [28], [43], [39], concentrates on the interplay between the most important width measures — ... -
One byte at a time: evidencing the quality of clinical service next-generation sequencing for germline and somatic variants
(Journal article; Peer reviewed, 2020)Next-generation sequencing (NGS) is replacing other molecular techniques to become the de facto gene diagnostics approach, transforming the speed of diagnosis for patients and expanding opportunities for precision medicine. ... -
Online learning through Reinforcement learning in a high-fidelity physics simulator
(Master thesis, 2022-11-21) -
The Ontology Lookup Service: bigger and better
(Peer reviewed; Journal article, 2010-05-11)The Ontology Lookup Service (OLS; http://www.ebi .ac.uk/ols) has been providing several means to query, browse and navigate biomedical ontologies and controlled vocabularies since it first went into production 4 years ago, ... -
Optimal preparation of graph states
(Peer reviewed; Journal article, 2011-04-12)We show how to prepare any graph state of up to 12 qubits with: (a) the minimum number of controlled-Z gates, and (b) the minimum preparation depth. We assume only one-qubit and controlled-Z gates. The method exploits the ... -
Optimal ternary cyclic codes with minimum distance four and five
(Journal article, 2014-11)Cyclic codes are an important subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics. In this paper, two families of optimal ternary cyclic codes are ... -
Optimization issues in medical imaging and fiber-tracking
(Doctoral thesis, 2008-02-27)Fiber tracking is a relatively recent methodology, made possible by access to new highly advanced MR scanners able to produce high-quality diffusion tensor images (DTI), which promises clinicians a possibility to observe ... -
Optimization Models for Turbine Location in Wind Farms
(Master thesis, 2012-05-24)The topic of this thesis is wind farm optimization. The goal is to be able to decide where to install wind turbines within a given region in order to maximize the power output in two different scenarios: For a fixed number ...