Now showing items 228-247 of 773

    • Exploring Subexponential Parameterized Complexity of Completion Problems 

      Drange, Pål Grønås; Fomin, Fedor; Pilipczuk, Michal Pawel; Villanger, Yngve (Peer reviewed; Journal article, 2014-02-19)
      Let F be a family of graphs. In the F-Completion problem, we are given an n-vertex graph G and an integer k as input, and asked whether at most k edges can be added to G so that the resulting graph does not contain a graph ...
    • Exploring the evolution of protein function in Archaea 

      Goncearenco, Alexander; Berezovsky, Igor N. (Peer reviewed; Journal article, 2012-05-30)
      Background: Despite recent progress in studies of the evolution of protein function, the questions what were the first functional protein domains and what were their basic building blocks remain unresolved. Previously, we ...
    • Exponential time algorithms: Structures, measures, and bounds 

      Gaspers, Serge (Doctoral thesis, 2008-12-05)
      This thesis studies exponential time algorithms, more precisely, algorithms exactly solving problems for which no polynomial time algorithm is known and likely to exist. Interested in worst–case upper bounds on the running ...
    • Expressive Visualization and Rapid Interpretation of Seismic Volumes 

      Patel, Daniel (Doctoral thesis, 2009-10-27)
      One of the most important resources in the world today is energy. Oil and gas provide two thirds of the world energy consumption, making the world completely dependent on it. Locating and recovering the remaining oil and ...
    • Extending balance assessment for the generalized propensity score under multiple imputation 

      Frank, Anna-Simone; Matteson, David S.; Solvang, Hiroko Kato; Lupattelli, Angela; Nordeng, Hedvig Marie Egeland (Journal article; Peer reviewed, 2020)
      This manuscript extends the definition of the Absolute Standardized Mean Difference (ASMD) for binary exposure (M = 2) to cases for M > 2 on multiple imputed data sets. The Maximal Maximized Standardized Difference (MMSD) ...
    • Extensive intraspecies cryptic variation in an ancient embryonic gene regulatory network 

      Torres Cleuren, Yamila Nicole; Ewe, Chee Kiang; Chipman, Kyle C; Mears, Emily R; Wood, Cricket G; Al-Alami, Coco Emma Alma; Alcorn, Melissa R; Turner, Thomas L; Joshi, Pradeep M; Snell, Russell G; Rothman, Joel H (Peer reviewed; Journal article, 2019-08-15)
      Innovations in metazoan development arise from evolutionary modification of gene regulatory networks (GRNs). We report widespread cryptic variation in the requirement for two key regulatory inputs, SKN-1/Nrf2 and MOM-2/Wnt, ...
    • Fast biclustering by dual parameterization 

      Drange, Pål Grønås; Reidl, Felix; Villaamil, Fernando Sánchez; Sikdar, Somnath (Conference object; Peer reviewed; Journal article, 2015)
      We study two clustering problems, Starforest Editing, the problem of adding and deleting edges to obtain a disjoint union of stars, and the generalization Bicluster Editing. We show that, in addition to being NP-hard, none ...
    • Fast Method for Maximum-Flow Problem with Minimum-Lot Sizes 

      Ganeshan, Vithya (Master thesis, 2015-03-03)
      In transportation networks, such as pipeline networks for transporting natural gas, it is often impractical to send across amounts of flow below a certain threshold. Such lower threshold is referred as the minimum-lot size. ...
    • Fast methods to solve the pooling problem 

      Kejriwal, Anisha (Master thesis, 2014-05-31)
      In pipeline transportation of natural gas, simple network flow problems are replaced by hard ones when bounds on the flow quality are imposed. The sources, typically represented by gas wells, provide flow of unequal ...
    • Faster enumeration of minimal connected dominating sets in split graphs 

      Skjørten, Ida Bredal (Master thesis, 2017-06-20)
      Graphs are mathematical objects that can be used to model many real world problems. An example is a roadmap, where the nodes in the graph represent cities and the edges of the graph represent roads. An interesting and ...
    • Fault tolerant subgraphs with applications in kernelization 

      Lochet, William; Lokshtanov, Daniel; Misra, Pranabendu; Saurabh, Saket; Sharma, Roohani; Zehavi, Meirav (Journal article; Peer reviewed, 2020)
      In the past decade, the design of fault tolerant data structures for networks has become a central topic of research. Particular attention has been given to the construction of a subgraph H of a given digraph D with as ...
    • Filtering duplicate reads from 454 pyrosequencing data 

      Balzer, Susanne Mignon; Malde, Ketil; Grohme, Markus A.; Jonassen, Inge (Peer reviewed; Journal article, 2013)
      Motivation: Throughout the recent years, 454 pyrosequencing has emerged as an efficient alternative to traditional Sanger sequencing and is widely used in both de novo whole-genome sequencing and metagenomics. Especially ...
    • Filtering of FTLE for Visualizing Spatial Separation in Unsteady 3D Flow 

      Pobitzer, Armin; Peikert, Ronald; Fuchs, Raphael; Theisel, Holger; Hauser, Helwig (Peer reviewed; Journal article, 2012)
      In many cases, feature detection for flow visualization is structured in two phases: first candidate identification, and then filtering. With this paper, we propose to use the directional information contained in the ...
    • Finding even subgraphs even faster 

      Goyal, Prachi; Misra, Pranabendu; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket (Conference object; Peer reviewed; Journal article, 2015)
      Problems of the following kind have been the focus of much recent research in the realm of parameterized complexity: Given an input graph (digraph) on n vertices and a positive integer parameter k, find if there exist k ...
    • Finding Induced Subgraphs via Minimal Triangulations 

      Fomin, Fedor; Villanger, Yngve (Conference object; Peer reviewed; Journal article, 2010)
      Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems in- cluding Minimum Fill-in and Treewidth. We discover unexpected ...
    • Finding k Disjoint Triangles in an Arbitrary Graph 

      Fellows, Mike; Heggernes, Pinar; Rosamond, Frances; Sloper, Christian; Telle, Jan Arne (Conference object, 2004)
    • Finding Resource Bounds in the Presence of Explicit Deallocation 

      Truong, Anh Hoang; Bezem, Marcus A. (Journal article, 2005-10-17)
      A software program requesting a resource that is not available usually raises an out-of-resource exception. Component software is software that has been assembled from standardized, reusable components which, in turn, may ...
    • Finite and Confident Teaching in Expectation: Sampling from Infinite Concept Classes 

      Hernández-Orallo, José; Telle, Jan Arne (Frontiers in Artificial Intelligence and Applications;325, Chapter, 2020)
      We investigate the teaching of infinite concept classes through the effect of the learning prior (which is used by the learner to derive posteriors giving preference of some concepts over others and by the teacher to devise ...
    • Firewalls: Enforcement of Security Policy in networks 

      Nordås, Harald (Master thesis, 2014-11-20)
      Firewalls are set up to protect computer networks. Originally, networks were just coupled together, in order to achieve connection. With the ability to reach networks all over the world, one started to denote this the ...