Continuous queries applied over nonterminating data streams usually specify windows in order to obtain an evolving –yet restricted– set of tuples and thus provide timely result...
The goal of multi-objective clustering (MOC) is to decompose a dataset into similar groups maximizing multiple objectives in parallel. In this paper, we provide a methodology, arch...
Rachsuda Jiamthapthaksin, Christoph F. Eick, Ricar...
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
Abstract. We study tolerant linearity testing under general distributions. Given groups G and H, a distribution µ on G, and oracle access to a function f : G → H, we consider th...
We study the problem of automatically discovering semantic associations between schema elements, namely foreign keys. This problem is important in all applications where data sets...
Alexandra Rostin, Oliver Albrecht, Jana Bauckmann,...