Now showing items 76-95 of 643

    • Colluding Tags Attack on the ECC-based Grouping Proofs for Rfids 

      Abyaneh, Mohammad Reza Sohizadeh (Conference object, 2012)
      Recently, a new privacy-preserving elliptic curve based grouping proof protocol with colluding tag prevention( CTP) has been proposed. The CTP protocol is claimed to be resistant against colluding tags attacks in which the ...
    • Combining Aspect-Oriented and Strategic Programming 

      Kalleberg, Karl Trygve; Visser, Eelco (Peer reviewed; Journal article, 2006-01)
      Properties such as logging, persistence, debugging, tracing, distribution, performance monitoring and exception handling occur in most programming paradigms and are normally very difficult or even impossible to modularizewith ...
    • Community curation of bioinformatics software and data resources 

      Ison, Jon; Ménager, Hervé; Brancotte, Bryan; Jaaniso, Erik; Salumets, Ahto; Raček, Tomáš; Lamprecht, Anna-Lena; Palmblad, Magnus; Kalaš, Matúš; Chmura, Piotr; Hancock, John M; Schwämmle, Veit; Ienasescu, Hans-Ioan (Peer reviewed; Journal article, 2019)
      The corpus of bioinformatics resources is huge and expanding rapidly, presenting life scientists with a growing challenge in selecting tools that fit the desired purpose. To address this, the European Infrastructure for ...
    • Community Detection in Complex Networks 

      Lund, Herman Møyner (Master thesis, 2017-06-20)
    • Community Detection in Social Networks 

      Fasmer, Erlend Eindride (Master thesis, 2015-05-01)
      Social networks usually display a hierarchy of communities and it is the task of community detection algorithms to detect these communities and preferably also their hierarchical relationships. One common class of such ...
    • Community Detection on the GPU 

      Naim, Md.; Manne, Fredrik; Halappanavar, Mahantesh; Tumeo, Antonino (Conference object; Peer reviewed, 2017)
      We present and evaluate a new GPU algorithm based on the Louvain method for community detection. Our algorithm is the first for this problem that parallelizes the access to individual edges. In this way we can fine tune ...
    • Community-driven development for computational biology at Sprints, Hackathons and Codefests 

      Möller, Steffen; Afgan, Enis; Banck, Michael; Bonnal, Raoul J. P.; Booth, Timothy; Chilton, John; Cock, Peter J. A.; Gumbel, Markus; Harris, Nomi; Holland, Richard; Kalaš, Matúš; Kaján, László; Kibukawa, Eri; Powel, David R.; Prins, Pjotr; Quinn, Jacqueline; Sallou, Olivier; Strozzi, Francesco; Seemann, Torsten; Sloggett, Clare; Soiland-Reyes, Stian; Spooner, William; Steinbiss, Sascha; Tille, Andreas; Travis, Anthony J.; Guimera, Roman V.; Katayama, Toshiaki; Chapman, Brad A. (Peer reviewed; Journal article, 2014-11-27)
      Background: Computational biology comprises a wide range of technologies and approaches. Multiple technologies can be combined to create more powerful workflows if the individuals contributing the data or providing tools ...
    • A Comparative Analysis of Feature Selection Methods for Biomarker Discovery in Study of Toxicant-Treated Atlantic Cod (Gadus Morhua) Liver 

      Zhang, Xiaokang; Jonassen, Inge (Chapter; Conference object; Peer reviewed, 2019)
      Univariate and multivariate feature selection methods can be used for biomarker discovery in analysis of toxicant exposure. Among the univariate methods, differential expression analysis (DEA) is often applied for its ...
    • A Comparative Study on Distributed Storage and Erasure Coding Techniques Using Apache Hadoop Over NorNet Core 

      Vela, Maximiliano Matias (Master thesis, 2017)
      Both private and public sector organizations are constantly looking for new ways to keep their information safe and accessible at all times. Over the past few decades, replication has always been a reliable way to make ...
    • Comparative Visualization of Protein Secondary Structures 

      Kocincova, Lucia; Jaresova, Miroslava; Byska, Jan; Parulek, Julius; Hauser, Helwig; Kozlikova, Barbora (Peer reviewed; Journal article, 2017-02-15)
      Background: Protein function is determined by many factors, namely by its constitution, spatial arrangement, and dynamic behavior. Studying these factors helps the biochemists and biologists to better understand the protein ...
    • Comparing 17 graph parameters 

      Sasák, Róbert (Master thesis, 2010-08-02)
      Many parametrized problems were decided to be FPT or W-hard. However, there is still thousands of problems and parameters for which we do not know yet whether are FPT or W-hard. In this thesis, we provide a tool for extending ...
    • Comparison between instrumental variable and mediation-based methods for reconstructing causal gene networks in yeast 

      Ludl, Adriaan-Alexander; Michoel, Tom Luk Robert (Journal article; Peer reviewed, 2021)
      Causal gene networks model the flow of information within a cell. Reconstructing causal networks from omics data is challenging because correlation does not imply causation. When genomics and transcriptomics data from a ...
    • Comparison of Discrete and Continuous Models for the Pooling Problem 

      Alfaki, Mohammed; Haugland, Dag (Chapter; Peer reviewed, 2011)
      The pooling problem is an important global optimization problem which is encountered in many industrial settings. It is traditionally modeled as a bilinear, nonconvex optimization problem, and solved by branch-and-bound ...
    • Comparison of OpenMP and Threading Building Blocks for expressing parallelism on shared-memory systems 

      Refsnes, Peder Rindal (Master thesis, 2011-02-01)
      The thesis offers a comparison of OpenMP and Intel Threading Building blocks. The two are threading packages used to express parallelism in programs. In addition, the thesis presents a promising scalable algorithm for ...
    • Comparison of RNA-folding structures, in-vivo, in-vitro and in-silico 

      Roodashty, Hanieh (Master thesis, 2019-10-31)
      The main objective of the work has been to develop the understanding of the difference between RNA structure probing approaches; in vivo, in vitro and in silico. Similarities and differences between three libraries of data ...
    • Comparison of Solving Techniques for Non-linear Sparse Equations over Finite Fields with Application in Cryptanalysis 

      Schilling, Thorsten Ernst (Master thesis, 2008)
      The work on this thesis gives a summary of the Gluing/Agreeing techniques, as well as a reference implementation of this methods. Furthermore widely used SAT-solving techniques are explained and a short insight to the ...
    • A Comparison of Vertex and Edge Partitioning Approaches for Parallel Maximal Matching 

      Sørnes, Alexander N (Master thesis, 2013-12-09)
      This thesis will compare two ways of distributing data for parallel graph algorithms: vertex and edge partitioning, using a distributed memory system. Previous studies on the parallelization of graphs has often been focused ...
    • A complexity dichotomy for critical values of the b-chromatic number of graphs 

      Lima, Paloma T.; Jaffke, Lars (Journal article; Peer reviewed, 2020)
      A b-coloring of a graph G is a proper coloring of its vertices such that each color class contains a vertex that has at least one neighbor in all the other color classes. The b-Coloring problem asks whether a graph G has ...
    • A complexity dichotomy for critical values of the b-chromatic number of graphs 

      Jaffke, Lars; Lima, Paloma T. (Peer reviewed; Journal article, 2019-08-20)
      A b-coloring of a graph G is a proper coloring of its vertices such that each color class contains a vertex that has at least one neighbor in all the other color classes. The b-Coloring problem asks whether a graph G has ...
    • Complexity of the Steiner Network Problem with Respect to the Number of Terminals 

      Eiben, Eduard; Knop, Dusan; Panolan, Fahad; Suchý, Ondřej (Journal article; Peer reviewed, 2019)
      In the Directed Steiner Network problem we are given an arc-weighted digraph G, a set of terminals T subseteq V(G) with |T|=q, and an (unweighted) directed request graph R with V(R)=T. Our task is to output a subgraph H ...