Now showing items 1-20 of 1210

    • Sequenced event set pattern matching 

      Cadonna B; Gamper J; Böhlen MH (ACM, 2011)
      Event pattern matching is a query technique where a sequence of input events is matched against a complex pattern that specifies constraints on extent, order, values, and quantification of matching events. The increasing ...
    • MOUNA: Mining opinions to unveil neglected arguments 

      Kacimi El Hassani M; Gamper J (ACM, 2012)
      A query topic can be subjective involving a variety of opinions, judgments, arguments, and many other debatable aspects. Typically, search engines process queries independently from the nature of their topics using a ...
    • Workshop for doctoral students in Fuzzy-Based Systems 

      Gamper J; Moser B (Springer, 1993)
      This one-day-workshop held in conjunction with the FLAI’93 conference is intended to enhance the personal and professional development of Ph.D.-level students who are working in the field of fuzzy-based systems. It will ...
    • Finding k-dissimilar paths with minimum collective length 

      Chondrogiannis T; Bouros P; Gamper J; Leser U; Blumenthal DB (ACM, 2018)
      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 study the problem of finding k-Dissimilar ...
    • Period Index: A Learned 2D Hash Index for Range and Duration Queries 

      Behrend A; Dignös A; Gamper J; Schmiegelt P; Voigt H; Rottmann M; Kahl K (ACM, 2019)
      Today, most commercial database systems provide some support for the management of temporal data, but the index support for efficiently accessing such data is rather limited. Existing access paths neglect the fact that ...
    • Individualized Hiking Time Estimation 

      Pitman A; Zanker M; Gamper J; Andritsos P (IEEE, 2012)
      Route planning algorithms attempt to find the optimum path between two nodes in a graph, where a cost function specifies a weight for each edge. In many situations cost is related to distance or time. While time estimates ...
    • Query Time Scaling of Attribute Values in Interval Timestamped Databases 

      Dignös A; Böhlen M; Gamper J (IEEE, 2013)
      In valid-time databases with interval timestamping each tuple is associated with a time interval over which the recorded fact is true in the modeled reality. The adjustment of these intervals is an essential part of ...
    • HotPeriods: Visual Correlation Analysis of Interval Data 

      Duran N; Mahlknecht G; Dignös A; Gamper J (ACM, 2019)
      With the ever increasing amount and complexity of data, visual correlation analysis is a fundamental tool to find correlations and relationships in the data. Most of the previous techniques (e.g., scatter plots or heat ...
    • Scalable computation of isochrones with network expiration 

      Gamper J; Böhlen MH; Innerebner M (Springer, 2012)
      An isochrone in a spatial network is the possibly disconnected set of all locations from where a query point is reachable within a given time span and by a given arrival time. In this paper we propose an efficient and ...
    • Efficient event pattern matching with match windows 

      Cadonna B; Gamper J; Böhlen MH (ACM, 2012)
      In event pattern matching a sequence of input events is matched against a complex query pattern that specifies constraints on extent, order, values, and quantification of matching events. In this paper we propose a general ...
    • Defining isochrones in multimodal spatial networks 

      Gamper J; Böhlen MH; Cometti W; Innerebner M (ACM, 2011)
      An isochrone in a spatial network is the minimal, possibly disconnected subgraph that covers all locations from where a query point is reachable within a given time span and by a given arrival time. In this paper we formally ...
    • GPU-Based Parallelism for ASP-Solving 

      Dovier A; Formisano A; Vella F (Springer, 2020)
      Answer Set Programming (ASP) has become the paradigm of choice in the field of logic programming and non-monotonic reasoning. With the design of new and efficient solvers, ASP has been successfully adopted in a wide range ...
    • Emulating Self-adaptive Stochastic Petri Nets 

      Capra L; Camilli M (Springer, 2020)
      Traditional Petri nets lack specific features to conveniently describe systems with an evolving structure. A model based on the Symmetric Net formalism has been recently introduced. It is composed of an emulator reproducing ...
    • An Architecture-independent Data Model for Managing Information Generated by Human-chatbot Interactions 

      Luca M; Montresor A; Caprini C; Miorandi D (SciTe Press, 2020)
      This paper introduces a data model for representing humans-chatbots interactions. Despite there are many models that allow representing the usage and the behaviour of bots, a service that can store information from any ...
    • StuffIE: Semantic Tagging of Unlabeled Facets Using Fine-Grained Information Extraction 

      Prasojo RE; Kacimi M; Nutt W (ACM, 2018)
      Recent knowledge extraction methods are moving towards ternary and higher-arity relations to capture more information about binary facts. An example is to include the time, the location, and the duration of a specific fact. ...
    • Semantic Technologies for Data Access and Integration 

      Calvanese D; Xiao G (ACM, 2018)
      Recently, semantic technologies have been successfully deployed to overcome the typical difficulties in accessing and integrating data stored in different kinds of legacy sources. In particular, knowledge graphs are being ...
    • Variants of the Block-GMRES Method for Solving Linear Systems with Multiple Right-Hand Sides 

      Sun DL; Carpentieri B; Huang TZ; Jing YF; Naveed S (IEEE, 2018)
      The solution of large linear systems with multiple right-hand sides given simultaneously is required in many largescale scientific and engineering applications modelled by either partial differential or boundary integral ...
    • Special Track on Bioinformatics (BIO) 

      Lecca P; Tulpan D; Corchado J (ACM, 2018)
    • Enriching Ontology-based Data Access with Provenance 

      Calvanese D; Lanti D; Ozaki A; Peñaloza R; Xiao G (AAAI Press, 2019)
      Ontology-based data access (OBDA) is a popular paradigm for querying heterogeneous data sources by connecting them through mappings to an ontology. In OBDA, it is often difficult to reconstruct why a tuple occurs in the ...