Blar i Department of Informatics på tittel
Viser treff 290309 av 649

Interpolationbased Decoding of Nonlinear Maximum Rank Distance Codes
(Peer reviewed; Journal article, 2019)In this paper, we formulate a generic construction of MRD codes that covers almost all the newly found MRD codes. Among those MRD codes, we particularly investigate the encoding and decoding of a family of nonlinear MRD ... 
Investigating Streamless Sets
(Conference object; 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
(Conference object, 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 ... 
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 openaccess database of transcription factor binding profiles
(Peer reviewed; Journal article, 201401)JASPAR (http://jaspar.genereg.net) is the largest openaccess database of matrixbased nucleotide profiles describing the binding preference of transcription factors from multiple species. The fifth major release greatly ... 
KCore Decomposition with CUDA
(Master thesis, 20201218) 
Kpacking and Kdomination on tree graphs
(Master thesis, 2004) 
Kernel(s) for Problems with No Kernel: On OutTrees with Many Leaves
(Conference object; Peer reviewed; Journal article, 2009)The {\sc \(k\)Leaf OutBranching} problem is to find an outbranching, 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 of Vertex Cover by Structural Parameters
(Master thesis, 20150803)In the NPcomplete 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 2connected graphs G and H are 2isomorphic, or equivalently, their cycle matroids are isomorphic, if and only if G can be transformed into H by a series of operations ... 
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 ... 
Largest chordal and interval subgraphs faster than 2n
(Peer reviewed; Journal article, 20150822)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) ... 
Learning Description Logic Ontologies: Five Approaches. Where Do They Stand?
(Journal article; Peer reviewed, 2020)The quest for acquiring a formal representation of the knowledge of a domain of interest has attracted researchers with various backgrounds into a diverse field called ontology learning. We highlight classical machine ... 
Lex M versus MCSM
(Journal article, 2006) 
Linear dependencies between nonuniform distributions in DES
(Master thesis, 20140530)Davies and Murphy explained some nonuniform distributions of the output from pairs and triplets of Sboxes 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) 
Localizing Cell Towers from Crowdsourced Measurements
(Master thesis, 20150601)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 ... 
Looking at the Stars
(20060228) 
LowRank Binary Matrix Approximation in ColumnSum Norm
(Journal article; Peer reviewed, 2020)We consider 𝓁₁Rankr 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 columnsum norm ‖ 𝐀 𝐁‖₁. We show ...