• Computing Connected Components on Multiple GPUs 

      Hellås, Yngve (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 

      Pilipczuk, Michal Pawel (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) 

      Heggernes, Pinar; Telle, Jan Arne; Villanger, Yngve (Journal article, 2005)
    • Connecting the Dots (with Minimum Crossings) 

      Agrawal, Akanksha; Guspiel, Grzegorz; Madathil, Jayakrishnan; Saurabh, Saket; Zehavi, Meirav (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 

      Basavaraju, Manu; Fomin, Fedor; Golovach, Petr; Saurabh, Saket (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 ...
    • Conserved BK Channel-Protein Interactions Reveal Signals Relevant to Cell Death and Survival 

      Sokolowski, Bernd; Orchard, Sandra; Harvey, Margaret; Sridhar, Settu; Sakai, Yoshihisa (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 

      Garrison, Laura Ann; Bruckner, Stefan (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 

      Wolter, Uwe Egbert; König, Harald (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 ...
    • Constructing APN functions through isotopic shifts 

      Budaghyan, Lilya; Calderini, Marco; Carlet, Claude; Coulter, Robert; Villa, Irene (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 

      Bezem, Marc; Buchholtz, Ulrik; Grayson, Daniel R.; Shulman, Michael (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 

      Parulek, Julius; Jönsson, Daniel; Ropinski, Timo; Bruckner, Stefan; Ynnerman, Anders; Viola, Ivan (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 ...
    • Convergence of Feedback Arc Set-Based Heuristics for Linear Structural Equation Models 

      Gillot, Pierre; Parviainen, Pekka (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 

      Flåm, Sjur Didrik (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: ...
    • Cost-sensitive ensemble learning: a unifying framework 

      Petrides, George; Verbeke, Wouter (Journal article; Peer reviewed, 2022)
      Over the years, a plethora of cost-sensitive methods have been proposed for learning on data when different types of misclassification errors incur different costs. Our contribution is a unifying framework that provides a ...
    • Counting Instances of Software Components 

      Bezem, Marcus A.; Truong, Anh Hoang (Proceedings of LRPP'04: Workshop on Logics for Resources, Processes, and Programs, Turku, Finland, July 13, 2004, Conference lecture, 2004-07-13)
      Component software is software that has been assembled from various pieces of standardized, reusable computer programs, so-called components. Executing component software creates instances of these components. For several ...
    • Counting research ⇒ directing research : the hazard of using simple metrics to evaluate scientific contributions : an EU experience 

      Olsen, Kai A.; Malizia, Alessio (Journal article; Peer reviewed, 2017)
      In many EU countries there is a requirement to count research, i.e., to measure and prove its value. These numbers, often produced automatically based on the impact of journals, are used to rank universities, to determine ...
    • Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals 

      Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav (Peer reviewed; Journal article, 2019)
      Perturbed graphic matroids are binary matroids that can be obtained from a graphic matroid by adding a noise of small rank. More precisely, an r-rank perturbed graphic matroid M is a binary matroid that can be represented ...
    • CRISPR Genome Editing Made Easy Through the CHOPCHOP Website 

      Labun, Kornel; Krause, Maximilian; Torres Cleuren, Yamila Nicole; Valen, Eivind Dale (Journal article; Peer reviewed, 2021)
      The design of optimal guide RNA (gRNA) sequences for CRISPR systems is challenged by the need to achieve highly efficient editing at the desired location (on-target editing) with minimal editing at unintended locations ...
    • A critical view on Public Key Infrastructures 

      Tjøstheim, Thomas (Master thesis, 2004)
    • Cross-Site Scripting Protection in Firefox. Creating a filter for Firefox protecting against Reflected cross-site scripting attacks 

      Vikne, Andreas Svardal (Master thesis, 2018-08-21)
      One of the most dominant threats against web applications is the class of script injection attacks, also called cross-site scripting. This class of attacks affects the client-side of a web application, and is a critical ...