• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 4
  • Tagged with
  • 4
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Efficient algorithms for shape and pattern matching

Mosig, Axel. Unknown Date (has links) (PDF)
University, Diss., 2004--Bonn. / Erscheinungsjahr auf der Hauptitelstelle: 2003.
2

Inferring score level musical information from low-level musical data

Kilian, Jürgen. Unknown Date (has links)
Techn. University, Diss., 2004--Darmstadt.
3

Transmigration of object identity

Costanza, Pascal. Unknown Date (has links) (PDF)
University, Diss., 2004--Bonn.
4

DebEAQ - debugging empty-answer queries on large data graphs

Lehner, Wolfgang, Vasilyeva, Elena, Heinze, Thomas, Thiele, Maik 12 January 2023 (has links)
The large volume of freely available graph data sets impedes the users in analyzing them. For this purpose, they usually pose plenty of pattern matching queries and study their answers. Without deep knowledge about the data graph, users can create ‘failing’ queries, which deliver empty answers. Analyzing the causes of these empty answers is a time-consuming and complicated task especially for graph queries. To help users in debugging these ‘failing’ queries, there are two common approaches: one is focusing on discovering missing subgraphs of a data graph, the other one tries to rewrite the queries such that they deliver some results. In this demonstration, we will combine both approaches and give the users an opportunity to discover why empty results were delivered by the requested queries. Therefore, we propose DebEAQ, a debugging tool for pattern matching queries, which allows to compare both approaches and also provides functionality to debug queries manually.

Page generated in 0.0599 seconds