![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Martin Pfeifle Hans-Peter Kriegel , Peter Kunath , Martin Pfeifle, Matthias Renz : Statistic Driven Acceleration of Object-Relational Space-Partitioning Index Structures. DASFAA 2004 : 169-183 Hans-Peter Kriegel , Martin Pfeifle, Marco Pötke , Thomas Seidl : A Cost Model for Spatial Intersection Queries on RI-Trees. DASFAA 2004 : 331-338 Eshref Januzaj , Hans-Peter Kriegel , Martin Pfeifle: DBDC: Density Based Distributed Clustering. EDBT 2004 : 88-105 Stefan Brecheisen , Hans-Peter Kriegel , Peer Kröger , Martin Pfeifle, Maximilian Viermetz , Marco Pötke : BOSS: Browsing OPTICS-Plots for Similarity Search. ICDE 2004 : 858 Hans-Peter Kriegel , Martin Pfeifle, Marco Pötke , Thomas Seidl : The Paradigm of Relational Indexing: a Survey. BTW 2003 : 285-304 Hans-Peter Kriegel , Martin Pfeifle, Marco Pötke , Matthias Renz , Thomas Seidl : Spatial Data Management for Virtual Product Development. Computer Science in Perspective 2003 : 216-230 Hans-Peter Kriegel , Martin Pfeifle, Marco Pötke , Thomas Seidl : Spatial Query Processing for High Resolutions. DASFAA 2003 : 17-26 Hans-Peter Kriegel , Peer Kröger , Zahi Mashael , Martin Pfeifle, Marco Pötke , Thomas Seidl : Effective Similarity Search on Voxelized CAD Object. DASFAA 2003 : 27- Hans-Peter Kriegel , Stefan Brecheisen , Peer Kröger , Martin Pfeifle, Matthias Schubert : Using Sets of Feature Vectors for Similarity Search on Voxelized CAD Objects. SIGMOD Conference 2003 : 587-598 Hans-Peter Kriegel , Peter Kunath , Martin Pfeifle, Matthias Renz : Acceleration of Relational Index Structures Based on Statistics. SSDBM 2003 : 258-261 Hans-Peter Kriegel , Martin Pfeifle, Marco Pötke , Thomas Seidl : A Cost Model for Interval Intersection Queries on RI-Trees. SSDBM 2002 : 131-141 1 [ 3 ] [ 8 ] 2 [ 9 ] 3 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] 4 [ 3 ] [ 4 ] [ 8 ] 5 [ 2 ] [ 11 ] 6 [ 4 ] 7 [ 1 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 10 ] 8 [ 2 ] [ 6 ] [ 11 ] 9 [ 3 ] 10 [ 1 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 10 ] 11 [ 8 ] ![]() ©2004 Association for Computing Machinery |