Nye registreringer

  • ScrollyVis: Interactive Visual Authoring of Guided Dynamic Narratives for Scientific Scrollytelling 

    Mörth, Eric; Bruckner, Stefan; Smit, Noeska Natasja (Journal article; Peer reviewed, 2023)
    Visual stories are an effective and powerful tool to convey specific information to a diverse public. Scrollytelling is a recent visual storytelling technique extensively used on the web, where content appears or changes ...
  • Coding for DNA-based Storage Systems 

    Maarouf, Issam (Doctoral thesis, 2024-05-24)
    DNA-basert lagring, eller lagring av brukerdata i deoksyribonukleinsyre (DNA) tråder, kan teoretisk gi dramatisk høyere lagringskapasitet og lagringsrobusthet sammenlignet med dagens lagringsteknologier. Flere småskalaek ...
  • Targeting performance and user-friendliness: GPU-accelerated finite element computation with automated code generation in FEniCS 

    Trotter, James David; Langguth, Johannes; Cai, Xing (Journal article; Peer reviewed, 2023)
    This paper studies the use of automated code generation to provide user-friendly GPU acceleration for solving partial differential equations (PDEs) with finite element methods. By extending the FEniCS framework and its ...
  • Enabling unstructured-mesh computation on massively tiled AI processors: An example of accelerating in silico cardiac simulation 

    Burchard, Luk Bjarne; Hustad, Kristian Gregorius; Langguth, Johannes; Cai, Xing (Journal article; Peer reviewed, 2023)
    A new trend in processor architecture design is the packaging of thousands of small processor cores into a single device, where there is no device-level shared memory but each core has its own local memory. Thus, both the ...
  • Computing Width Parameters of Graphs 

    Korhonen, Tuukka (Doctoral thesis, 2024-05-15)
    Trebredden til en graf beskriver dens likhet med trær ved hvor godt den kan dekomponeres ved hjelp av små separatorer. Den er definert som minimumsbredden av en tre-dekomponering av grafen. Når en graf er gitt sammen med ...
  • The Ultimate GUI Framework: Are We There Yet? 

    Stokke, Knut Anders; Barash, Mikhail; Järvi, Jaakko Timo Henrik (Journal article; Peer reviewed, 2023)
    The programming community seems to be forever searching for the ultimate user interface programming approach and the accompanying framework. We describe the landscape of recent efforts in this quest through describing ...
  • A domain-specific language for structure manipulation in constraint system-based GUIs 

    Stokke, Knut Anders; Barash, Mikhail; Järvi, Jaakko Timo Henrik (Journal article, 2023)
    A common frustration with programming Graphical User Interfaces (GUIs) is that features for manipulating structures, such as lists and trees, are limited, inconsistent, buggy, or even missing. Implementing complete and ...
  • Multi-Task Optimization in Reliability Redundancy Allocation Problem: A Multifactorial Evolutionary-Based Approach 

    Nath, Rahul; Chowdury, Md. Abdul Malek; Shukla, Amit K.; Rauniyar, Amit; Muhuri, Pranab K. (Journal article; Peer reviewed, 2024)
    Evolutionary multi-task optimization attempts to solve multiple optimization problems simultaneously by modeling the solution structures of two or more problems within a single encoding. In this paper, we report a novel ...
  • Hardware architecture of Dillon's APN permutation for different primitive polynomials 

    Imaña, José L.; Kaleyski, Nikolay Stoyanov; Budaghyan, Lilya (Journal article; Peer reviewed, 2023)
    Cryptographically strong functions used as S-boxes in block cyphers are fundamental for the cypher’s security. Their representation as lookup tables is possible for functions of small dimension. For larger dimensions, this ...
  • A contrastive learning approach for individual re-identification in a wild fish population 

    Olsen, Ørjan Langøy; Sørdalen, Tonje Knutsen; Goodwin, Morten; Malde, Ketil; Knausgård, Kristian Muri; Halvorsen, Kim Aleksander Tallaksen (Journal article; Peer reviewed, 2023)
    In both terrestrial and marine ecology, physical tagging is a frequently used method to study population dynamics and behavior. However, such tagging techniques are increasingly being replaced by individual re-identification ...
  • Annotating otoliths with a deep generative model 

    Bojesen, Troels Arnfred; Denechaud, Côme; Malde, Ketil (Journal article; Peer reviewed, 2023)
    Otoliths are a central information source for fish ecology and stock management, conveying important data about age and other life history for individual fish. Traditionally, interpretation of otoliths has required skilled ...
  • Covering Radius of Generalized Zetterberg Type Codes Over Finite Fields of Odd Characteristic 

    Shi, Minjia; Helleseth, Tor; Özbudak, Ferruh (Journal article; Peer reviewed, 2023)
    Let Fq0 be a finite field of odd characteristic. For an integer s≥1 , let Cs(q0) be the generalized Zetterberg code of length qs0+1 over Fq0 . If s is even, then we prove that the covering radius of Cs(q0) is 3. Put q=qs0 ...
  • New Results on the -1 Conjecture on Cross-Correlation of m-Sequences Based on Complete Permutation Polynomials 

    Wu, GaoFei; Feng, Keqin; Li, Nian; Helleseth, Tor (Journal article; Peer reviewed, 2023)
    The cross-correlation between two maximum length sequences (m-sequences) of the same period has been studied since the end of 1960s. One open conjecture by Helleseth states that the cross- correlation between any two p-ary ...
  • Detours in directed graphs 

    Fomin, Fedor; Golovach, Petr; Lochet, William Alexandre; Sagunov, Danil; Saurabh, Saket; Simonov, Kirill (Journal article; Peer reviewed, 2023)
    We study two “above guarantee” versions of the classical Longest Path problem on undirected and directed graphs and obtain the following results. In the first variant of Longest Path that we study, called Longest Detour, ...
  • Classes of intersection digraphs with good algorithmic properties 

    Jaffke, Lars; Kwon, O-joung; Telle, Jan Arne (Journal article; Peer reviewed, 2023)
    While intersection graphs play a central role in the algorithmic analysis of hard problems on undirected graphs, the role of intersection digraphs in algorithms is much less understood. We present several contributions ...
  • Parameterized complexity of categorical clustering with size constraints 

    Fomin, Fedor; Golovach, Petr; Purohit, Nidhi (Journal article; Peer reviewed, 2023)
  • Diverse collections in matroids and graphs 

    Fomin, Fedor; Golovach, Petr; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket (Journal article; Peer reviewed, 2023)
    We investigate the parameterized complexity of finding diverse sets of solutions to three fundamental combinatorial problems. The input to the Weighted Diverse Bases problem consists of a matroid M, a weight function ω : ...
  • Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs 

    Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. (Journal article; Peer reviewed, 2023)
    We introduce the rendezvous game with adversaries. In this game, two players, Facilitator and Divider, play against each other on a graph. Facilitator has two agents and Divider has a team of k agents located in some ...
  • Five-weight codes from three-valued correlation of M-sequences 

    Shi, Minjia; Qian, Liqin; Helleseth, Tor; Sole, Patrick (Journal article; Peer reviewed, 2023)
    In this paper, for each of six families of three-valued m-sequence correlation, we construct an infinite family of five-weight codes from trace codes over the ring R = F2 + uF2, where u2 = 0. The trace codes have the ...
  • Dynamic Programming on Bipartite Tree Decompositions 

    Jaffke, Lars; Morelle, Laure; Sau, Ignasi; Thilikos, Dimitrios M. (Journal article; Peer reviewed, 2023)
    We revisit a graph width parameter that we dub bipartite treewidth, along with its associated graph decomposition that we call bipartite tree decomposition. Bipartite treewidth can be seen as a common generalization of ...

Vis flere