• Recursive Time-Frequency Reassignment 

      Nilsen, Geir Kjetil (Master thesis, 2008-11-18)
      A fast algorithm for producing time-frequency representations (TFRs) is proposed. The resulting TFRs have optional time-frequency resolution up to optimality. The algorithm is further extended with a method known as ...
    • Reducing Graph Transversals via Edge Contractions 

      Lima, Paloma T.; dos Santos, Vinicius F.; Sau, Ignasi; Souza, Uéverton S. (Journal article; Peer reviewed, 2020)
      For a graph parameter π, the Contraction(π) problem consists in, given a graph G and two positive integers k,d, deciding whether one can contract at most k edges of G to obtain a graph in which π has dropped by at least ...
    • Refined Complexity of PCA with Outliers 

      Fomin, Fedor; Golovach, Petr; Panolan, Fahad; Simonov, Kirill (Peer reviewed; Journal article, 2019)
      Principal component analysis (PCA) is one of the most fundamental procedures in exploratory data analysis and is the basic step in applications ranging from quantitative finance and bioinformatics to image analysis and ...
    • Refined notions of parameterized enumeration kernels with applications to matching cut enumeration 

      Golovach, Petr; Komusiewicz, Christian; Kratsch, Dieter; Le, Van Bang (Journal article; Peer reviewed, 2021)
      An enumeration kernel as defined by Creignou et al. (2017) [11] for a parameterized enumeration problem consists of an algorithm that transforms each instance into one whose size is bounded by the parameter plus a ...
    • Reflections on Courses for Software Language Engineering 

      Bagge, Anya Helene; Lämmel, Ralf; Zaytsev, Vadim (Journal article; Peer reviewed, 2014)
      Software Language Engineering (SLE) has emerged as a field in computer science research and software engineering, but it has yet to become entrenched as part of the standard curriculum at universities. Many places have a ...
    • Regular Expressions with Numerical Constraints and Automata with Counters 

      Hovland, Dag (Lecture Notes in Computer Science, Chapter; Peer reviewed, 2009)
      Regular expressions with numerical constraints are an extension of regular expressions, allowing to bound numerically the number of times that a subexpression should be matched. Expressions in this extension describe the ...
    • Regulatory mechanisms of non-coding RNAs during zebrafish embryogenesis 

      Nepal, Chirag (Doctoral thesis, 2013-05-03)
      For many years, RNAs were thought to be intermediate products between DNA and protein. The discovery of RNA interference (RNAi), a regulatory process that uses small non-coding RNAs to regulate gene expression at the ...
    • Reinforcement Learning for Lifelong Multi-Agent Pathfinding in AutoStore system 

      Djupesland, Elias Eriksen (Master thesis, 2023-05-25)
      AutoStore (AS) uses a cubic system for warehouse automation, utilizing robots to retrieve and organize objects in a three-dimensional grid of bins in a Manhattan geometry environment. Lifelong Multi-Agent Pathfinding (LMAPF) ...
    • Relation between o-equivalence and EA-equivalence for Niho bent functions 

      Davidova, Diana; Budaghyan, Lilya; Carlet, Claude Michael; Helleseth, Tor; Ihringer, Ferdinand; Penttila, Tim (Journal article; Peer reviewed, 2021)
      Boolean functions, and bent functions in particular, are considered up to so-called EA-equivalence, which is the most general known equivalence relation preserving bentness of functions. However, for a special type of bent ...
    • Relative Persistent Homology 

      Blaser, Nello; Brun, Morten (Journal article; Peer reviewed, 2020)
      The alpha complex efficiently computes persistent homology of a point cloud X in Euclidean space when the dimension d is low. Given a subset A of X, relative persistent homology can be computed as the persistent homology ...
    • Relative Persistent Homology 

      Blaser, Nello; Brun, Morten (Journal article; Peer reviewed, 2022)
      The alpha complex efficiently computes persistent homology of a point cloud X in Euclidean space when the dimension d is low. Given a subset A of X, relative Čech persistent homology can be computed as the persistent ...
    • Reliable Asynchronous Communication in Distributed Systems 

      Johnsen, Espen (Master thesis, 2018-04-11)
    • Repeats and EST analysis for new organisms 

      Malde, Ketil; Jonassen, Inge (Journal article, 2008-01-18)
      Background Repeat masking is an important step in the EST analysis pipeline. For new species, genomic knowledge is scarce and good repeat libraries are typically unavailable. In these cases it is common practice to mask ...
    • Resolute control: Forbidding candidates from winning an election is hard 

      Gupta, Sushmita; Roy, Sanjukta; Saurabh, Saket; Zehavi, Meirav (Journal article; Peer reviewed, 2022)
    • Restricted maximum-likelihood method for learning latent variance components in gene expression data with known and unknown confounders 

      Malik, Muhammad Ammar; Michoel, Tom (Journal article; Peer reviewed, 2022)
      Random effects models are popular statistical models for detecting and correcting spurious sample correlations due to hidden confounders in genome-wide gene expression data. In applications where some confounding factors ...
    • Revisiting Language Support for Generic Programming: When Genericity Is a Core Design Goal 

      Chetioui, Benjamin; Järvi, Jaakko Timo Henrik; Haveraaen, Magne (Journal article; Peer reviewed, 2022)
      Context Generic programming, as defined by Stepanov, is a methodology for writing efficient and reusable algorithms by considering only the required properties of their underlying data types and operations. Generic ...
    • Ridge Extraction, and Illustrative Visualization of an FTLE Flow Field. 

      Sivertsen, Stian (Master thesis, 2012-06-01)
      Illustrative visualization of a flow is an area that is proving to be interesting and in later years something that have been somewhat explored, it can provide some very interesting results and in this thesis we find the ...
    • Risks in Networked Computer Systems 

      Klingsheim, André N. (Doctoral thesis, 2008-09-24)
      Networked computer systems yield great value to businesses and governments, but also create risks. The eight papers in this thesis highlight vulnerabilities in computer systems that lead to security and privacy risks. A ...
    • Robust Cross-Platform Workflows: How Technical and Scientific Communities Collaborate to Develop, Test and Share Best Practices for Data Analysis 

      Möller, Steffen; Prescott, Stuart W.; Wirzenius, Lars; Reinholdtsen, Petter; Chapman, Brad; Prins, Pjotr; Soiland-Reyes, Stian; Klötzl, Fabian; Bagnacani, Andrea; Kalaš, Matúš; Tille, Andreas; Crusoe, Michael R. (Peer reviewed; Journal article, 2017-09)
      Information integration and workflow technologies for data analysis have always been major fields of investigation in bioinformatics. A range of popular workflow suites are available to support analyses in computational ...
    • Robust Independent Validation of Experiment and Theory: Rivet version 3 

      Bierlich, Christian; Buckley, Andy; Butterworth, J. M.; Corpe, L.; Grellscheid, David; Gütschow, C.; Karczmarczyk, P.; Klein, J.; Lönnblad, Leif; Pollard, C. S.; Schulz, Holger; Siegert, Frank (Journal article; Peer reviewed, 2020)
      First released in 2010, the Rivet library forms an important repository for analysis code, facilitating comparisons between measurements of the final state in particle collisions and theoretical calculations of those final ...