Given a set F of faulty edges or faulty vertices in the hypercube Qn and a pair of vertices u, v, is there a hamiltonian cycle or a hamiltonian path between u and v in Qn −F? We...
Regular tree queries (RTQs) are a class of queries considered especially relevant for the expressiveness and evaluation of XML query languages. The algorithms proposed so far for ...
Workflow mining is the task of automatically producing a workflow model from a set of event logs recording sequences of workflow events; each sequence corresponds to a use case or ...
Javier Esparza, Martin Leucker, Maximilian Schlund
This paper deals with the minimal polyadic decomposition (also known as canonical decomposition or Parafac) of a 3way array, assuming each entry is positive. In this case, the low...
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...