Department of Informatics: Nye registreringer
Viser treff 21-40 av 1056
-
Trajectory-based fish event classification through pre-training with diffusion models
(Journal article; Peer reviewed, 2024)This study contributes to advancing the field of automatic fish event recognition in natural underwater videos, addressing the current gap in studying fish interaction and competition, including predator-prey relationships ... -
Efficient Preprocessing and Algorithm for Bicluster Editing with Vertex Splitting
(Master thesis, 2025-03-13)Bicluster editing, a cousin to the well-known cluster editing problem, is gaining interest due to its applications in domains such as social network analysis, recommendation, biology, and markets. This thesis introduces ... -
MPCC: strong stability of weakly nondegenerate S-stationary points
(Journal article; Peer reviewed, 2024)In this paper, we consider the class of mathematical programmes with complementarity constraints (MPCC). Specifically, we focus on strong stability of M- and S-stationary points for MPCC. Kojima introduced this concept for ... -
TØIRoads: A Road Data Model Generation Tool
(Journal article; Peer reviewed, 2024)We describe road data models which can represent high level features of a road network such as population, points of interest, and road length/cost and capacity, while abstracting from time and geographic location. Such ... -
Predicting the genetic component of gene expression using gene regulatory networks
(Journal article; Peer reviewed, 2024)Motivation Gene expression prediction plays a vital role in transcriptome-wide association studies. Traditional models rely on genetic variants in close genomic proximity to the gene of interest to predict the genetic ... -
The MoBa Pregnancy and Child Development Dashboard: A Design Study
(Journal article; Peer reviewed, 2024)Visual analytics dashboards enable exploration of complex medical and genetic data to uncover underlying patterns and possible relationships between conditions and outcomes. In this interdisciplinary design study, we present ... -
Paradoxes versus Contradictions in Logic of Sentential Operators
(Journal article; Peer reviewed, 2024)Classical logic, of first or higher order, is extended with sentential operators and quantifiers, interpreted substitutionally over unrestricted substitution class. Operators mark a single layered, consistent metalanguage. ... -
Exponential-Time Approximation Schemes via Compression
(Journal article; Peer reviewed, 2024)In this paper, we give a framework to design exponential-time approximation schemes for basic graph partitioning problems such as k-way cut, Multiway Cut, Steiner k-cut and Multicut, where the goal is to minimize the number ... -
Discovering Bayesian Networks when Few Variables Matter
(Journal article; Peer reviewed, 2024)Learning the structure of a Bayesian network from data is one of the key problems in probabilistic graphical models. Unfortunately, the problem is NP-hard and this has motivated recent works where the problem has been ... -
Longest Cycle above Erdős–Gallai Bound
(Journal article; Peer reviewed, 2024)In 1959, Erdős and Gallai proved that every graph \(G\) with average vertex degree \({\sf ad}(G)\geq 2\) contains a cycle of length at least \({\sf ad}(G)\). We provide an algorithm that for \(k\geq 0\), in time ... -
Stability in Graphs with Matroid Constraints
(Journal article; Peer reviewed, 2024)We study the following INDEPENDENT STABLE SET problem. Let G be an undirected graph and ℳ = (V(G), ℐ) be a matroid whose elements are the vertices of G. For an integer k ≥ 1, the task is to decide whether G contains a set ... -
Breaking a Graph into Connected Components with Small Dominating Sets
(Journal article; Peer reviewed, 2024)We study DOMINATED CLUSTER DELETION. Therein, we are given an undirected graph G = (V,E) and integers k and d and the task is to find a set of at most k vertices such that removing these vertices results in a graph in which ... -
Hybrid k-Clustering: Blending k-Median and k-Center
(Journal article; Peer reviewed, 2024)We propose a novel clustering model encompassing two well-known clustering models: k-center clustering and k-median clustering. In the Hybrid k-Clustering problem, given a set P of points in ℝ^d, an integer k, and a ... -
Cuts in Graphs with Matroid Constraints
(Journal article; Peer reviewed, 2024)Vertex (s, t)-Cut and Vertex Multiway Cut are two fundamental graph separation problems in algorithmic graph theory. We study matroidal generalizations of these problems, where in addition to the usual input, we are given ... -
Computing Tree Decompositions with Small Independence Number
(Journal article; Peer reviewed, 2024)The independence number of a tree decomposition is the maximum of the independence numbers of the subgraphs induced by its bags. The tree-independence number of a graph is the minimum independence number of a tree decomposition ... -
Fixed-Parameter Tractability of Maximum Colored Path and beyond
(Journal article; Peer reviewed, 2024)We introduce a general method for obtaining fixed-parameter algorithms for problems about finding paths in undirected graphs, where the length of the path could be unbounded in the parameter. The first application of our ... -
MAP- and MLE-Based Teaching
(Journal article; Peer reviewed, 2024)Imagine a learner L who tries to infer a hidden concept from a collection of observations. Building on the work of Ferri et al. (2022), we assume the learner to be parameterized by priors P (c) and by c-conditional likelihoods ... -
FPT approximation and subexponential algorithms for covering few or many edges
(Journal article; Peer reviewed, 2024)We study the 𝛼-FIXED CARDINALITY GRAPH PARTITIONING (𝛼-FCGP) problem, the generic local graph partitioning problem introduced by Bonnet et al. [Algorithmica 2015]. In this problem, we are given a graph 𝐺, two numbers ... -
Low-Complexity Hardware Architecture of APN Permutations Using TU-Decomposition
(Journal article; Peer reviewed, 2024)Functions with good cryptographic properties which are used as S-boxes in the design of block ciphers have a fundamental importance to the security of these ciphers since they determine the resistance to various kinds of ... -
Approximating Long Cycle Above Dirac’s Guarantee
(Journal article; Peer reviewed, 2024)Parameterization above (or below) a guarantee is a successful concept in parameterized algorithms. The idea is that many computational problems admit “natural” guarantees bringing to algorithmic questions whether a better ...