Viser treff 338-357 av 751

• #### 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 ﻿

(Conference object; 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 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 ...
• #### 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) ...
• #### 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 MCS-M ﻿

(Journal article, 2006)
• #### Linear dependencies between non-uniform distributions in DES ﻿

(Master thesis, 2014-05-30)
Davies and Murphy explained some non-uniform distributions of the output from pairs and triplets of S-boxes 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, 2015-06-01)
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 ﻿

(2006-02-28)
• #### Low-Rank Binary Matrix Approximation in Column-Sum Norm ﻿

(Journal article; Peer reviewed, 2020)
We consider 𝓁₁-Rank-r 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 column-sum norm ‖ 𝐀 -𝐁‖₁. We show ...
• #### Lower bounds on the size of spheres of permutations under the Chebychev distance ﻿

(Peer reviewed; Journal article, 2010)
Lower bounds on the number of permutations p of {1, 2, . . . , n} satisfying |pi − i| ≤ d for all i are given
• #### Machine Learning Approaches for Biomarker Discovery Using Gene Expression Data ﻿

(Chapter, 2021)
Biomarkers are of great importance in many fields, such as cancer research, toxicology, diagnosis and treatment of diseases, and to better understand biological response mechanisms to internal or external intervention. ...
• #### Machine learning approaches for high-dimensional genome-wide association studies ﻿

(Doctoral thesis, 2022-08-24)
Formålet med Genome-wide association studies (GWAS) er å finne statistiske sammenhenger mellom genetiske varianter og egenskaper av interesser. De genetiske variantene som forklarer mye av variasjonene i genomfattende ...
• #### Machine Learning methods for mood disorder decision support ﻿

(Master thesis, 2017-07-11)