Blar i Department of Informatics på tittel
Viser treff 525-544 av 1124
-
Investigating Biases in Rules Extracted from Language Models
(Master thesis, 2023-08-01)We investigate an approach for extracting occupational gender bias in the form of logical rules from Large Language Models (LLM)s based on Angluin's exact learning model with membership and equivalence queries to an oracle. ... -
Investigating Streamless Sets
(Journal article; Peer reviewed, 2015)In this paper we look at streamless sets, recently investigated by Coquand and Spiwack. A set is streamless if every stream over that set contain a duplicate. It is an open question in constructive mathematics whether the ... -
Investigating the Limitations of Java Annotations for Input Validation
(Chapter; Peer reviewed, 2010)Recently Java annotations have received a lot of attention as a possible way to simplify the usage of various frameworks, ranging from persistence and verification to security. In this paper we discuss our experiences in ... -
Is there a Tornado in Alex's Blood Flow? A Case Study for Narrative Medical Visualization
(Journal article; Peer reviewed, 2022)Narrative visualization advantageously combines storytelling with new media formats and techniques, like interactivity, to create improved learning experiences. In medicine, it has the potential to improve patient understanding ... -
IsoTrotter: Visually Guided Empirical Modelling of Atmospheric Convection
(Journal article; Peer reviewed, 2020)Empirical models, fitted to data from observations, are often used in natural sciences to describe physical behaviour and support discoveries. However, with more complex models, the regression of parameters quickly becomes ... -
J2ME Bluetooth programming
(Master thesis, 2004) -
JASPAR 2014: An extensively expanded and updated open-access database of transcription factor binding profiles
(Peer reviewed; Journal article, 2014-01)JASPAR (http://jaspar.genereg.net) is the largest open-access database of matrix-based nucleotide profiles describing the binding preference of transcription factors from multiple species. The fifth major release greatly ... -
K-Core Decomposition with CUDA
(Master thesis, 2020-12-18) -
K-packing and K-domination on tree graphs
(Master thesis, 2004) -
Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves
(Peer reviewed; Journal article, 2009)The {\sc \(k\)-Leaf Out-Branching} problem is to find an out-branching, that is a rooted oriented spanning tree, with at least \(k\) leaves in a given digraph. The problem has recently received much attention from the ... -
Kernelization for Balanced Graph Clustering
(Master thesis, 2020-10-03)The problems of Balanced Graph Clustering ask whether it is possible to modify a graph such that it becomes a cluster graph where no cluster has a size larger than a given multiplicative factor or absolute difference ... -
Kernelization of Graph Hamiltonicity: Proper H-Graphs
(Journal article; Peer reviewed, 2021)We obtain new polynomial kernels and compression algorithms for Path Cover and Cycle Cover, the well-known generalizations of the classical Hamiltonian Path and Hamiltonian Cycle problems. Our choice of parameterization ... -
Kernelization of Vertex Cover by Structural Parameters
(Master thesis, 2015-08-03)In the NP-complete problem Vertex Cover, one is given a graph G and an integer k and are asked whether there exists a vertex set S ⊆ V (G) with size at most k such that every edge of the graph is incident to a vertex in ... -
Kernelization of Whitney Switches
(Journal article; Peer reviewed, 2020)A fundamental theorem of Whitney from 1933 asserts that 2-connected graphs G and H are 2-isomorphic, or equivalently, their cycle matroids are isomorphic, if and only if G can be transformed into H by a series of operations ... -
Kernelization of Whitney Switches
(Journal article; Peer reviewed, 2021)A fundamental theorem of Whitney from 1933 asserts that 2-connected graphs $G$ and $H$ are 2-isomorphic, or equivalently, their cycle matroids are isomorphic if and only if $G$ can be transformed into $H$ by a series of ... -
Kernels of digraphs with finitely many ends
(Journal article; Peer reviewed, 2019)According to Richardson’s theorem, every digraph without directed odd cycles that is either (a) locally finite or (b) rayless has a kernel (an independent subset with an incoming edge from every vertex in ). We generalize ... -
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, 2015-08-22)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) ... -
Lattice Sieving With G6K
(Master thesis, 2023-06-01)Recent advances in quantum computing threaten the cryptography we use today. This has led to a need for new cryptographic algorithms that are safe against quantum computers. The American standardization organization NIST ... -
Learning Acquisition Functions for Cost-aware Bayesian Optimization
(Master thesis, 2023-08-01)