activity
20112020
most citedEfficient Information Flow Maximization in Probabilistic Graphs

10 citations · 12 across the 5 of their papers we have counts for

collaborators

5 papers

cs.DB2020★ 1 cited

Complete and Sufficient Spatial Domination of Multidimensional Rectangles

Tobias Emrich, Hans-Peter Kriegel, Andreas Züfle +2

Rectangles are used to approximate objects, or sets of objects, in a plethora of applications, systems and index structures. Many tasks, such as nearest neighbor search and similar…

cs.DS2017★ 10 cited

Efficient Information Flow Maximization in Probabilistic Graphs

Christian Frey, Andreas Züfle, Tobias Emrich +1

Reliable propagation of information through large networks, e.g., communication networks, social networks or sensor networks is very important in many applications concerning marke…

cs.DB2013★ 1 cited

Probabilistic Nearest Neighbor Queries on Uncertain Moving Object Trajectories

Johannes Niedermayer, Andreas Züfle, Tobias Emrich +4

Nearest neighbor (NN) queries in trajectory databases have received significant attention in the past, due to their application in spatio-temporal data analysis. Recent work has co…

cs.DB2011

Inverse Queries For Multidimensional Spaces

Thomas Bernecker, Tobias Emrich, Hans-Peter Kriegel +4

Traditional spatial queries return, for a given query object , all database objects that satisfy a given predicate, such as epsilon range and -nearest neighbors. This paper d…

cs.DB2011

A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases

Thomas Bernecker, Tobias Emrich, Hans-Peter Kriegel +3

In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach supports a general u…