Blar i Department of Informatics på tittel
Viser treff 197-216 av 1199
-
Computing Complexity Measures of Degenerate Graphs
(Journal article; Peer reviewed, 2023)We show that the VC-dimension of a graph can be computed in time n^{⌈log d+1⌉} d^{O(d)}, where d is the degeneracy of the input graph. The core idea of our algorithm is a data structure to efficiently query the number of ... -
Computing Connected Components on Multiple GPUs
(Master thesis, 2018-12-19)We look at multiple GPU programming, using the connected components algorithm as the basis when we look into libraries and runtime environment for multiple GPU programming. We also show that Rem is a fast parallel algorithm, ... -
Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings
(Peer reviewed; Journal article, 2013)The notions of cutwidth and pathwidth of digraphs play a central role in the containment theory for tournaments, or more generally semi-complete digraphs, developed in a recent series of papers by Chudnovsky, Fradkin, Kim, ... -
Computing minimal triangulation in Time o(n^2.376)
(Journal article, 2005) -
Computing Paths of Large Rank in Planar Frameworks Deterministically
(Journal article; Peer reviewed, 2023)A framework consists of an undirected graph G and a matroid M whose elements correspond to the vertices of G. Recently, Fomin et al. [SODA 2023] and Eiben et al. [ArXiV 2023] developed parameterized algorithms for computing ... -
Computing Twitter Influence with a GPU
(Master thesis, 2020-09-01) -
Computing Width Parameters of Graphs
(Doctoral thesis, 2024-05-15)Trebredden til en graf beskriver dens likhet med trær ved hvor godt den kan dekomponeres ved hjelp av små separatorer. Den er definert som minimumsbredden av en tre-dekomponering av grafen. Når en graf er gitt sammen med ... -
Connecting the Dots (with Minimum Crossings)
(Journal article; Peer reviewed, 2019)We study a prototype Crossing Minimization problem, defined as follows. Let F be an infinite family of (possibly vertex-labeled) graphs. Then, given a set P of (possibly labeled) n points in the Euclidean plane, a collection ... -
Connecting Vertices by Independent Trees
(Journal article; Peer reviewed, 2014)We study the paramereteized complexity of the following connectivity problem. For a vertex subset U of a graph G, trees T1, . . . , Ts of G are completely independent spanning trees of U if each of them contains U , and ... -
The Connections Among Hamming Metric, b-Symbol Metric, and r-th Generalized Hamming Metric
(Journal article; Peer reviewed, 2023)The r -th generalized Hamming metric and the b -symbol metric are two different generalizations of Hamming metric. The former is used on the wire-tap channel of Type II, and the latter is motivated by the limitations of ... -
Conserved BK Channel-Protein Interactions Reveal Signals Relevant to Cell Death and Survival
(Peer reviewed; Journal article, 2011-12-09)The large-conductance Ca2+-activated K+ (BK) channel and its b-subunit underlie tuning in non-mammalian sensory or hair cells, whereas in mammals its function is less clear. To gain insights into species differences and ... -
Considering Best Practices in Color Palettes for Molecular Visualizations
(Journal article; Peer reviewed, 2022)Biomedical illustration and visualization techniques provide a window into complex molecular worlds that are difficult to capture through experimental means alone. Biomedical illustrators frequently employ color to help ... -
Consistency of Heterogeneously Typed Behavioural Models: A Coalgebraic Approach
(Journal article; Peer reviewed, 2022)Systematic and formally underpinned consistency checking of heterogeneously typed interdependent behavioural models requires a common metamodel, into which the involved models can be translated. And, if additional system ... -
Consistency of LSO with syntactic equality
(Master thesis, 2023-06-01)LSO, Logic of Sentential Operators, is defined by extending first- order logic by sentential quantification and sentential operators. Its semantics is defined by a digraph, with kernels reflecting consistent valuations of ... -
Constructing APN functions through isotopic shifts
(Journal article; Peer reviewed, 2020)Almost perfect nonlinear (APN) functions over fields of characteristic 2 play an important role in cryptography, coding theory and, more generally, mathematics and information theory. In this paper we deduce a new method ... -
Construction of the circle in UniMath
(Journal article; Peer reviewed, 2021)We show that the type TZ of Z-torsors has the dependent universal property of the circle, which characterizes it up to a unique homotopy equivalence. The construction uses Voevodsky’s Univalence Axiom and propositional ... -
Continuous Levels-of-Detail and Visual Abstraction for Seamless Molecular Visualization
(Peer reviewed; Journal article, 2014-05-06)Molecular visualization is often challenged with rendering of large molecular structures in real time. We introduce a novel approach that enables us to show even large protein complexes. Our method is based on the ... -
A contrastive learning approach for individual re-identification in a wild fish population
(Journal article; Peer reviewed, 2023)In both terrestrial and marine ecology, physical tagging is a frequently used method to study population dynamics and behavior. However, such tagging techniques are increasingly being replaced by individual re-identification ... -
Convergence of Feedback Arc Set-Based Heuristics for Linear Structural Equation Models
(Journal article; Peer reviewed, 2022)Score-based structure learning in Bayesian networks, where local structures in the graph are given a score and one seeks to recover a high-scoring DAG from data, is an NP-hard problem. While the general learning problem ... -
Convexity, convolution and competitive equilibrium
(Journal article; Peer reviewed, 2023)This paper considers a chief interface between mathematical programming and economics, namely: money-based trade of perfectly divisible and transferable goods. Three important and related features are singled out here: ...