Now showing items 268-287 of 586

    • K-Core Decomposition with CUDA 

      Morken, Ole Magnus Mæland (Master thesis, 2020-12-18)
    • K-packing and K-domination on tree graphs 

      Mjelde, Morten (Master thesis, 2004)
    • Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves 

      Fernau, Henning; Fomin, Fedor; Lokshtanov, Daniel; Raible, Daniel; Saurabh, Saket; Villanger, Yngve (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 Vertex Cover by Structural Parameters 

      Strømme, Torstein Jarl Fagerbakke (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 

      Fomin, Fedor; Golovach, Petr (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 ...
    • Kernels of digraphs with finitely many ends 

      Walicki, Michal (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 

      Bliznets, Ivan; Fomin, Fedor; Pilipczuk, Michal Pawel; Villanger, Yngve (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? 

      Ozaki, Ana (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 

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

      Fauskanger, Stian (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 

      Ovnerud, Torbjørn (Master thesis, 2000)
    • Localizing Cell Towers from Crowdsourced Measurements 

      Rusvik, Johan Alexander Nordstrand (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 

      Prieto, Elena; Sloper, Christian (2006-02-28)
    • Low-Rank Binary Matrix Approximation in Column-Sum Norm 

      Fomin, Fedor; Golovach, Petr; Panolan, Fahad; Simonov, Kirill (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 

      Kløve, Torleiv (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 methods for mood disorder decision support 

      Oleksy, Tomasz Artur (Master thesis, 2017-07-11)
    • Macroscale mesenchymal condensation to study cytokine-driven cellular and matrix-related changes during cartilage degradation 

      Weber, Marie-Christin; Fischer, Lisa; Damerau, Alexandra; Ponomarev, Igor; Pfeiffenberger, Moritz; Gaber, Timo; Götschel, Sebastian; Lang, Jens; Röblitz, Susanna; Buttgereit, Frank; Ehrig, Rainald; Lang, Annemarie (Journal article; Peer reviewed, 2020)
      Understanding the pathophysiological processes of cartilage degradation requires adequate model systems to develop therapeutic strategies towards osteoarthritis (OA). Although different in vitro or in vivo models have been ...
    • Making the BKW Algorithm Practical for LWE 

      Budroni, Alessandro; Guo, Qian; Johansson, Thomas; Mårtensson, Erik; Stankovski Wagner, Paul (Journal article; Peer reviewed, 2020)
      The Learning with Errors (LWE) problem is one of the main mathematical foundations of post-quantum cryptography. One of the main groups of algorithms for solving LWE is the Blum-Kalai-Wasserman (BKW) algorithm. This paper ...
    • The male germ cell gene regulator CTCFL is functionally different from CTCF and binds CTCF-like consensus sites in a nucleosome composition-dependent manner 

      Sleutels, Frank; Soochit, Widia; Bartkuhn, Marek; Heath, Helen; Dienstbach, Sven; Bergmaier, Philipp; Franke, Vedran; Rosa-Garrido, Manuel; van de Nobelen, Suzanne; Caesar, Lisa; van der Reijden, Michael I.J.A.; Bryne, Jan Christian; van Ijcken, Wilfred F.J.; Grootegoed, J. Anton; Delgado, M. Dolores; Lenhard, Boris; Renkawitz, Rainer; Grosveld, Frank; Galjart, Niels (Peer reviewed; Journal article, 2012-06-18)
      Background: CTCF is a highly conserved and essential zinc finger protein expressed in virtually all cell types. In conjunction with cohesin, it organizes chromatin into loops, thereby regulating gene expression and epigenetic ...
    • Managing spatial selections with contextual snapshots 

      Mindek, Peter; Gröller, Eduard; Bruckner, Stefan (Peer reviewed; Journal article, 2014-12)
      Spatial selections are a ubiquitous concept in visualization. By localizing particular features, they can be analysed and compared in different views. However, the semantics of such selections often depend on specific ...