2 citations · 2 across the 4 of their papers we have counts for
5 papers
Robust and Provable Guarantees for Sparse Random Embeddings
Maciej Skorski, Alessandro Temperoni, Martin Theobald
In this work, we improve upon the guarantees for sparse random embeddings, as they were recently provided and analyzed by Freksen at al. (NIPS'18) and Jagadeesan (NIPS'19). Specifi…
AIR: A Light-Weight Yet High-Performance Dataflow Engine based on Asynchronous Iterative Routing
Vinu E. Venugopal, Martin Theobald, Samira Chaychi +1
Distributed Stream Processing Systems (DSPSs) are among the currently most emerging topics in data management, with applications ranging from real-time event monitoring to processi…
Lineage-Aware Temporal Windows: Supporting Set Operations in Temporal-Probabilistic Databases
Katerina Papaioannou, Martin Theobald, Michael H. Böhlen
In temporal-probabilistic (TP) databases, the combination of the temporal and the probabilistic dimension adds significant overhead to the computation of set operations. Although s…
Generalized Lineage-Aware Temporal Windows: Supporting Outer and Anti Joins in Temporal-Probabilistic Databases
Katerina Papaioannou, Martin Theobald, Michael Böhlen
The result of a temporal-probabilistic (TP) join with negation includes, at each time point, the probability with which a tuple of a positive relation matches none of the…
A General Framework for Anytime Approximation in Probabilistic Databases
Maarten Van den Heuvel, Floris Geerts, Wolfgang Gatterbauer +1
Anytime approximation algorithms that compute the probabilities of queries over probabilistic databases can be of great use to statistical learning tasks. Those approaches have bee…