| 2013 | ||
|---|---|---|
| c25 | Tobias Emrich, Peer Kröger, Johannes Niedermayer, Matthias Renz, Andreas Züfle: A Mutual Pruning Approach for RkNN Join Processing. BTW 2013: 21-35 | |
| 2012 | ||
| j4 | Hans-Peter Kriegel, Matthias Renz, Matthias Schubert, Andreas Züfle: Efficient Traffic Density Prediction in Road Networks Using Suffix Trees. KI 26(3): 233-240 (2012) | |
| c24 | Tobias Emrich, Hans-Peter Kriegel, Nikos Mamoulis, Matthias Renz, Andreas Züfle: Indexing uncertain spatio-temporal data. CIKM 2012: 395-404 | |
| c23 | Thomas Bernecker, Tobias Emrich, Hans-Peter Kriegel, Matthias Renz, Andreas Züfle: Probabilistic ranking in fuzzy object databases. CIKM 2012: 2647-2650 | |
| c22 | Tobias Emrich, Hans-Peter Kriegel, Johannes Niedermayer, Matthias Renz, André Suhartha, Andreas Züfle: Exploration of monte-carlo based probabilistic query processing in uncertain graphs. CIKM 2012: 2728-2730 | |
| c21 | Tobias Emrich, Hans-Peter Kriegel, Nikos Mamoulis, Matthias Renz, Andreas Züfle: Querying Uncertain Spatio-Temporal Data. ICDE 2012: 354-365 | |
| c20 | Thomas Bernecker, Hans-Peter Kriegel, Matthias Renz, Florian Verhein, Andreas Züfle: Probabilistic Frequent Pattern Growth for Itemset Mining in Uncertain Databases. SSDBM 2012: 38-55 | |
| c19 | Nina Hubig, Andreas Züfle, Tobias Emrich, Mario A. Nascimento, Matthias Renz, Hans-Peter Kriegel: Continuous Probabilistic Sum Queries in Wireless Sensor Networks with Ranges. SSDBM 2012: 96-105 | |
| 2011 | ||
| j3 | Thomas Bernecker, Tobias Emrich, Hans-Peter Kriegel, Matthias Renz, Stefan Zankl, Andreas Züfle: Efficient Probabilistic Reverse Nearest Neighbor Query Processing on Uncertain Data. PVLDB 4(10): 669-680 (2011) | |
| c18 | Thomas Bernecker, Tobias Emrich, Hans-Peter Kriegel, Nikos Mamoulis, Matthias Renz, Andreas Züfle: A novel probabilistic pruning approach to speed up similarity queries in uncertain databases. ICDE 2011: 339-350 | |
| c17 | Anna Follmann, Mario A. Nascimento, Andreas Züfle, Matthias Renz, Peer Kröger, Hans-Peter Kriegel: Continuous Probabilistic Count Queries in Wireless Sensor Networks. SSTD 2011: 279-296 | |
| c16 | Thomas Bernecker, Tobias Emrich, Hans-Peter Kriegel, Nikos Mamoulis, Matthias Renz, Shiming Zhang, Andreas Züfle: Inverse Queries for Multidimensional Spaces. SSTD 2011: 330-347 | |
| c15 | Hans-Peter Kriegel, Matthias Schubert, Andreas Züfle: Managing and Mining Multiplayer Online Games. SSTD 2011: 441-444 | |
| c14 | Tobias Emrich, Hans-Peter Kriegel, Peer Kröger, Matthias Renz, Johannes Senner, Andreas Züfle: A Visual Evaluation Framework for Spatial Pruning Methods. SSTD 2011: 507-511 | |
| c13 | Thomas Bernecker, Hans-Peter Kriegel, Nikos Mamoulis, Matthias Renz, Andreas Züfle: Continuous Inverse Ranking Queries in Uncertain Streams. SSDBM 2011: 37-54 | |
| i4 | Thomas Bernecker, Tobias Emrich, Hans-Peter Kriegel, Nikos Mamoulis, Matthias Renz, Andreas Züfle: A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases. CoRR abs/1101.2613 (2011) | |
| i3 | Thomas Bernecker, Tobias Emrich, Hans-Peter Kriegel, Nikos Mamoulis, Matthias Renz, Shiming Zhang, Andreas Züfle: Inverse Queries For Multidimensional Spaces. CoRR abs/1103.0172 (2011) | |
| 2010 | ||
| j2 | Matthias Renz, Reynold Cheng, Hans-Peter Kriegel, Andreas Züfle, Thomas Bernecker: Similarity Search and Mining in Uncertain Databases. PVLDB 3(2): 1653-1654 (2010) | |
| j1 | Thomas Bernecker, Hans-Peter Kriegel, Nikos Mamoulis, Matthias Renz, Andreas Züfle: Scalable Probabilistic Similarity Ranking in Uncertain Databases. IEEE Trans. Knowl. Data Eng. 22(9): 1234-1246 (2010) | |
| c12 | Kyoji Kawagoe, Thomas Bernecker, Hans-Peter Kriegel, Matthias Renz, Arthur Zimek, Andreas Züfle: Similarity Search in Time Series of Dynamical Model-based Systems. DEXA Workshops 2010: 110-114 | |
| c11 | Tobias Emrich, Hans-Peter Kriegel, Peer Kröger, Matthias Renz, Naixin Xu, Andreas Züfle: Reverse k-Nearest Neighbor monitoring on mobile objects. GIS 2010: 494-497 | |
| c10 | Tobias Emrich, Hans-Peter Kriegel, Peer Kröger, Matthias Renz, Andreas Züfle: Boosting spatial pruning: on optimal pruning of MBRs. SIGMOD Conference 2010: 39-50 | |
| i2 | Thomas Bernecker, Hans-Peter Kriegel, Matthias Renz, Florian Verhein, Andreas Züfle: Probabilistic Frequent Pattern Growth for Itemset Mining in Uncertain Databases (Technical Report). CoRR abs/1008.2300 (2010) | |
| 2009 | ||
| c9 | Thomas Bernecker, Hans-Peter Kriegel, Matthias Renz, Andreas Züfle: Probabilistic Ranking in Uncertain Vector Spaces. DASFAA Workshops 2009: 122-136 | |
| c8 | Elke Achtert, Hans-Peter Kriegel, Peer Kröger, Matthias Renz, Andreas Züfle: Reverse k-nearest neighbor search in dynamic and general metric databases. EDBT 2009: 886-897 | |
| c7 | Tobias Emrich, Hans-Peter Kriegel, Peer Kröger, Matthias Renz, Andreas Züfle: Constrained reverse nearest neighbor search on mobile objects. GIS 2009: 197-206 | |
| c6 | Hans-Peter Kriegel, Peer Kröger, Matthias Renz, Andreas Züfle, Alexander Katzdobler: Incremental Reverse Nearest Neighbor Ranking. ICDE 2009: 1560-1567 | |
| c5 | Thomas Bernecker, Hans-Peter Kriegel, Matthias Renz, Florian Verhein, Andreas Züfle: Probabilistic frequent itemset mining in uncertain databases. KDD 2009: 119-128 | |
| c4 | Thomas Bernecker, Hans-Peter Kriegel, Matthias Renz, Andreas Züfle: Hot Item Detection in Uncertain Data. PAKDD 2009: 673-680 | |
| c3 | Tobias Emrich, Hans-Peter Kriegel, Peer Kröger, Matthias Renz, Andreas Züfle: Incremental Reverse Nearest Neighbor Ranking in Vector Spaces. SSTD 2009: 265-282 | |
| c2 | Hans-Peter Kriegel, Peer Kröger, Matthias Renz, Andreas Züfle, Alexander Katzdobler: Reverse k-Nearest Neighbor Search Based on Aggregate Point Access Methods. SSDBM 2009: 444-460 | |
| i1 | Thomas Bernecker, Hans-Peter Kriegel, Nikos Mamoulis, Matthias Renz, Andreas Züfle: Scalable Probabilistic Similarity Ranking in Uncertain Databases (Technical Report). CoRR abs/0907.2868 (2009) | |
| 2008 | ||
| c1 | Hans-Peter Kriegel, Matthias Renz, Matthias Schubert, Andreas Züfle: Statistical Density Prediction in Traffic Networks. SDM 2008: 692-703 | |
Data released under the ODC-BY 1.0 license — See also our legal information page