Now showing items 235-254 of 649

    • Going Far from Degeneracy 

      Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav (Journal article; Peer reviewed, 2020)
      An undirected graph $G$ is $d$-degenerate if every subgraph of $G$ has a vertex of degree at most $d$. By the classical theorem of Erdös and Gallai from 1959, every graph of degeneracy $d>1$ contains a cycle of length at ...
    • Going Far From Degeneracy 

      Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav (Peer reviewed; Journal article, 2019-09-06)
      An undirected graph G is d-degenerate if every subgraph of G has a vertex of degree at most d. By the classical theorem of Erd\H{o}s and Gallai from 1959, every graph of degeneracy d>1 contains a cycle of length at least ...
    • Graph modification problems: Beyond the known boundaries 

      Agrawal, Akanksha (Doctoral thesis, 2017-11-17)
    • Graphical Computing Solution for Industrial Plant Engineering 

      Lima, Marcelo Furtado (Master thesis, 2017-06-21)
      When preparing an engineering operation on an industrial plant, reliable and updated models of the plant must be available for correct decisions and planning. However, especially in the case of offshore oil and gas ...
    • Grein. A New Non-Linear Cryptoprimitive 

      Thorsen, Ole Rydland (Master thesis, 2013-12-10)
      In this thesis, we will study a new stream cipher, Grein, and a new cryptoprimitive used in this cipher. The second chapter gives a brief introduction to cryptography in general. The third chapter looks at stream ciphers ...
    • Guaranteeing Resource Bounds for Component Software 

      Truong, Anh Hoang (Journal article, 2005-06-15)
      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 ...
    • Hard Mathematical Problems in Cryptography and Coding Theory 

      Varadharajan, Srimathi (Doctoral thesis, 2020-04-28)
      In this thesis, we are concerned with certain interesting computationally hard problems and the complexities of their associated algorithms. All of these problems share a common feature in that they all arise from, or have ...
    • Hash functions in Cryptography 

      Grah, Joseph Sterling (Master thesis, 2008)
      This thesis is concerned with giving both an overview of the application of hash functions in cryptography and a presentation of today's standard cryptographic hash functions. Cryptographic hash functions are a valuable ...
    • Hashfunksjoner for bruk i Digitale Signaturer 

      Solvik, Jan Anders (Master thesis, 1995)
    • Hierarchical clusterings of unweighted graphs 

      Høgemo, Svein; Paul, Christophe; Telle, Jan Arne (Journal article; Peer reviewed, 2020)
      We study the complexity of finding an optimal hierarchical clustering of an unweighted similarity graph under the recently introduced Dasgupta objective function. We introduce a proof technique, called the normalization ...
    • A Hierarchical Splitting Scheme to Reveal Insight into Highly Self-Occluded Integral Surfaces 

      Brambilla, Andrea; Viola, Ivan; Hauser, Helwig (Peer reviewed; Journal article, 2012)
      In flow visualization, integral surfaces are of particular interest for their ability to describe trajectories of massless particles. In areas of swirling motion, integral surfaces can become very complex and difficult to ...
    • High-Dimensional Bayesian Network Inference From Systems Genetics Data Using Genetic Node Ordering 

      Wang, Lingfei; Audenaert, Pieter; Michoel, Tom Luk Robert (Journal article; Peer reviewed, 2019)
      Studying the impact of genetic variation on gene regulatory networks is essential to understand the biological mechanisms by which genetic variation causes variation in phenotypes. Bayesian networks provide an elegant ...
    • High-performance design patterns for modern Fortran 

      Haveraaen, Magne; Morris, Karla; Rouson, Damian; Radhakrishnan, Hari; Carson, Clayton (Peer reviewed; Journal article, 2015)
      This paper presents ideas for using coordinate-free numerics in modern Fortran to achieve code flexibility in the partial differential equation (PDE) domain. We also show how Fortran, over the last few decades, has changed ...
    • Highlights from the Eighth International Society for Computational Biology (ISCB) Student Council Symposium 2012 

      Goncearenco, Alexander; Grynberg, Priscila; Botvinnik, Olga B.; Macintyre, Geoff; Abeel, Thomas (Peer reviewed; Journal article, 2012-12-14)
      Abstract The report summarizes the scientific content of the annual symposium organized by the Student Council of the International Society for Computational Biology (ISCB) held in conjunction with the Intelligent Systems ...
    • Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable 

      Golovach, Petr; Thilikos, Dimitrios; Stamoulis, Giannos (Journal article; Peer reviewed, 2020)
      For a finite collection of graphs F, the F-TM-Deletion problem has as input an n-vertex graph G and an integer k and asks whether there exists a set S ⊆ V(G) with |S| ≤ k such that G \ S does not contain any of the graphs ...
    • How to cope with incorrect HTML 

      Parnas, Dagfinn (Master thesis, 2001)
    • Hybrid visibility compositing and masking for illustrative rendering 

      Bruckner, Stefan; Rautek, Peter; Viola, Ivan; Roberts, Mike; Sousa, Mario Costa; Gröller, M. Eduard (Peer reviewed; Journal article, 2010-08)
      In this paper, we introduce a novel framework for the compositing of interactively rendered 3D layers tailored to the needs of scientific illustration. Currently, traditional scientific illustrations are produced in a ...
    • Identifying elemental genomic track types and representing them uniformly 

      Gundersen, Sveinung; Kalaš, Matúš; Abul, Osman; Frigessi, Arnoldo; Hovig, Eivind; Sandve, Geir Kjetil (Peer reviewed; Journal article, 2011-12-30)
      Background: With the recent advances and availability of various high-throughput sequencing technologies, data on many molecular aspects, such as gene regulation, chromatin dynamics, and the three-dimensional organization ...
    • Illustrative Flow Visualization: State of the Art, Trends and Challenges 

      Brambilla, Andrea; Carnecky, Robert; Peikert, Robert; Viola, Ivan; Hauser, Helwig (Peer reviewed; Journal article, 2012)
      Flow visualization is a well established branch of scientific visualization and it currently represents an invaluable resource to many fields, like automotive design, meteorology and medical imaging. Thanks to the capabilities ...
    • Impact of physical obstacles on the structural and effective connectivity of in silico neuronal circuits 

      Ludl, Adriaan-Alexander; Soriano, Jordi (Journal article; Peer reviewed, 2020)
      Scaffolds and patterned substrates are among the most successful strategies to dictate the connectivity between neurons in culture. Here, we used numerical simulations to investigate the capacity of physical obstacles ...