1 citations · 1 across the 2 of their papers we have counts for
4 papers
Upper Bounding the Graph Edit Distance Based on Rings and Machine Learning
David B. Blumenthal, Johann Gamper, Sébastien Bougleux +1
The graph edit distance (GED) is a flexible distance measure which is widely used for inexact graph matching. Since its exact computation is NP-hard, heuristics are used in practic…
Snapshot Semantics for Temporal Multiset Relations (Extended Version)
Anton Dignös, Boris Glavic, Xing Niu +2
Snapshot semantics is widely used for evaluating queries over temporal data: temporal relations are seen as sequences of snapshot relations, and queries are evaluated at each snaps…
Finding k-Dissimilar Paths with Minimum Collective Length
Theodoros Chondrogiannis, Panagiotis Bouros, Johann Gamper +2
Shortest path computation is a fundamental problem in road networks. However, in many real-world scenarios, determining solely the shortest path is not enough. In this paper, we st…
Model-Based Diagnosis with Qualitative Temporal Uncertainty
Wolfgang Nejdl, Johann Gamper
In this paper we describe a framework for model-based diagnosis of dynamic systems, which extends previous work in this field by using and expressing temporal uncertainty in the fo…