• Exploring Ways of Creating an AI Drawing Assistant 

      Wergeland, Christian Mehl (Master thesis, 2022-07-01)
      Making a digital drawing assistant is a complicated problem for the simple reason that we are trying to make a computer program understand and create something that are as abstract as a drawing. Thus, there have been many ...
    • 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 ...
    • Expressing Unknown Instance Relations in Program Synthesis using Neurosymbolic Methods 

      Bolland, Sondre (Master thesis, 2021-10-04)
      Program synthesis is the task of automatically constructing a program given a high level specification. An instance of this is Inductive Logic Programming (ILP) were discrete methods are used to construct a logic program ...
    • 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) ...
    • Extensions in graph normal form 

      Walicki, Michal (Journal article; Peer reviewed, 2022)
      Graph normal form, introduced earlier for propositional logic, is shown to be a normal form also for first-order logic. It allows to view syntax of theories as digraphs, while their semantics as kernels of these digraphs. ...
    • 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, ...
    • Extracting Rules from Neural Networks with Partial Interpretations 

      Persia, Cosimo Damiano; Ozaki, Ana (Journal article; Peer reviewed, 2022)
      We investigate the problem of extracting rules, expressed in Horn logic, from neural network models. Our work is based on the exact learning model, in which a learner interacts with a teacher (the neural network model) via ...
    • Facilitating Dynamic Assessment of Psychological Interventions 

      Wisnes, Roger (Master thesis, 2021-07-16)
      The mental healthcare system requires an improvement in patient accessibility and a decrease in resource dependency. Internet-Delivered Psychological Treatment (IDPT) is a tool with a documented positive effect to bring ...
    • Facilitating Extended Reality in Museums through a Web-Based Application 

      Kvalvaag, Theodor Norill; Fardal, Sindre Stolberg (Master thesis, 2023-06-01)
    • FAIR+E pathogen data for surveillance and research: lessons from COVID-19 

      Neves, Aitana; Cuesta, Isabel; Hjerde, Erik; Klemetsen, Terje; Salgado, David; van Helden, Jacques; Rahman, Nadim; Fatima, Nazeefa; Karathanasis, Nestoras; Zmora, Pawel; Åkerström, Wolmar Nyberg; Grellscheid, Sushma Nagaraja; Waheed, Zahra; Blomberg, Niklas (Journal article; Peer reviewed, 2023)
      The COVID-19 pandemic has exemplified the importance of interoperable and equitable data sharing for global surveillance and to support research. While many challenges could be overcome, at least in some countries, many ...
    • Fast biclustering by dual parameterization 

      Drange, Pål Grønås; Reidl, Felix; Villaamil, Fernando Sánchez; Sikdar, Somnath (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 ...
    • Feature Selection for Identification of Transcriptome and Clinical Biomarkers for Relapse in Colon Cancer 

      Andreassen, Lloyd (Master thesis, 2021-06-01)
      This study attempts to find good predictive biomarkers for recurrence in colon cancer between two data sources of both mRNA and miRNA expression from frozen tumor samples. In total four datasets, two data sources and two ...
    • Features impacting the mesopelagic layer in the ocean: a machine learning-based approach 

      Lund, Marit Nodland (Master thesis, 2022-09-01)
      Context: Recently the United Nations proclaimed a Decade of Ocean Science for Sustainable Development (2021–2030) due to threats to the productivity and health of the ocean due to human impact. The One Ocean Expedition ...
    • 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 ...