Blar i Bergen Open Research Archive på tidsskrift "Lecture Notes in Computer Science (LNCS)"

Viser treff 21-28 av 28

    • The Perfect Matching Cut Problem Revisited 

      Telle, Jan Arne; Le, Van Bang (Journal article; Peer reviewed, 2021)
      In a graph, a perfect matching cut is an edge cut that is a perfect matching. perfect matching cut (pmc) is the problem of deciding whether a given graph has a perfect matching cut, and is known to be NP -complete. We ...

    • Quantitative Externalization of Visual Data Analysis Results Using Local Regression Models 

      Matkovic, Kresimir; Abraham, Hrvoje; Jelovic, Mario; Hauser, Helwig (Journal article; Peer reviewed, 2017)
      Both interactive visualization and computational analysis methods are useful for data studies and an integration of both approaches is promising to successfully combine the benefits of both methodologies. In interactive ...

    • Sparse Nerves in Practice 

      Blaser, Nello; Brun, Morten (Peer reviewed; Journal article, 2019)
      Topological data analysis combines machine learning with methods from algebraic topology. Persistent homology, a method to characterize topological features occurring in data at multiple scales is of particular interest. ...

    • Synthesis and Analysis of Petri Nets from Causal Specifications 

      De Oliveira Oliveira, Mateus (Journal article; Peer reviewed, 2022)
      Petri nets are one of the most prominent system-level formalisms for the specification of causality in concurrent, distributed, or multi-agent systems. This formalism is abstract enough to be analyzed using theoretical ...

    • A Test Collection for Interactive Lifelog Retrieval 

      Gurrin, Cathal; Schoeffmann, Klaus; Joho, Hideo; Münzer, Bernd; Albatal, Rami; Hopfgartner, Frank; Zhou, Liting; Dang Nguyen, Duc Tien (Peer reviewed; Journal article, 2019)
      There is a long history of repeatable and comparable evaluation in Information Retrieval (IR). However, thus far, no shared test collection exists that has been designed to support interactive lifelog retrieval. In this ...

    • Three problems on well-partitioned chordal graphs 

      Ahn, Jungho; Jaffke, Lars; Kwon, O-Joung; Lima, Paloma Thome de (Journal article; Peer reviewed, 2021)
      In this work, we solve three problems on well-partitioned chordal graphs. First, we show that every connected (resp., 2-connected) well-partitioned chordal graph has a vertex that intersects all longest paths (resp., longest ...

    • Twinning-by-Construction: Ensuring Correctness for Self-adaptive Digital Twins 

      Kamburjan, Eduard; Din, Crystal Chang; Schlatte, Rudolf; Tapia Tarifa, Silvia Lizeth; Johnsen, Einar Broch (Journal article; Peer reviewed, 2022)
      Digital twin applications use digital artefacts to twin physical systems. The purpose is to continuously mirror the structure and behavior of the physical system, such that users can analyse the physical system by means ...

    • What Is Known About Vertex Cover Kernelization? 

      Fellows, Michael R.; Jaffke, Lars; Király, Aliz Izabella; Rosamond, Frances; Weller, Mathias (Peer reviewed; Journal article, 2018)
      We are pleased to dedicate this survey on kernelization of the Vertex Cover problem, to Professor Juraj Hromkovič on the occasion of his 60th birthday. The Vertex Cover problem is often referred to as the Drosophila of ...