![]() | ![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 58 | Elke Achtert, Christian Böhm, Hans-Peter Kriegel, Peer Kröger, Ina Müller-Gorman, Arthur Zimek: Detection and Visualization of Subspace Cluster Hierarchies. DASFAA 2007: 152-163 | |
| 55 | Elke Achtert, Christian Böhm, Hans-Peter Kriegel, Peer Kröger, Arthur Zimek: Robust, Complete, and Efficient Correlation Clustering. SDM 2007 | |
| 54 | Elke Achtert, Christian Böhm, Hans-Peter Kriegel, Peer Kröger, Arthur Zimek: On Exploring Complex Relationships of Correlation Clusters. SSDBM 2007: 7 | |
| 47 | Elke Achtert, Christian Böhm, Hans-Peter Kriegel, Peer Kröger, Arthur Zimek: Deriving quantitative models for correlation clusters. KDD 2006: 4-13 | |
| 44 | Elke Achtert, Christian Böhm, Hans-Peter Kriegel, Peer Kröger, Ina Müller-Gorman, Arthur Zimek: Finding Hierarchies of Subspace Clusters. PKDD 2006: 446-453 | |
| 39 | Elke Achtert, Christian Böhm, Stefan Brecheisen, Hans-Peter Kriegel, Peter Kunath, Alexey Pryakhin, Matthias Renz, Matthias Schubert: Komplexe Objektbeschreibungen zur Suche in Multimedia-Datenbanken. Datenbank-Spektrum 19: 32-39 (2006) | |
| 38 | Elke Achtert, Christian Böhm, Hans-Peter Kriegel, Peer Kröger: Online Hierarchical Clustering in a Data Warehouse Environment. ICDM 2005: 10-17 | |
| 37 | Christian Böhm, Hans-Peter Kriegel, Peer Kröger, Petra Linhart: Selectivity Estimation of High Dimensional Window Queries via Clustering. SSTD 2005: 1-18 | |
| 34 | Christian Böhm, Karin Kailing, Hans-Peter Kriegel, Peer Kröger: Density Connected Clustering with Local Subspace Preferences. ICDM 2004: 27-34 | |
| 31 | Christian Böhm, Karin Kailing, Peer Kröger, Hans-Peter Kriegel: Immer größere und komplexere Datenmengen: Herausforderungen für Clustering-Algorithmen. Datenbank-Spektrum 9: 11-17 (2004) | |
| 28 | Christian Böhm, Florian Krebs, Hans-Peter Kriegel: Optimal Dimension Order: A Generic Technique for the Similarity Join. DaWaK 2002: 135-149 | |
| 26 | Christian Böhm, Hans-Peter Kriegel: Optimale Dimensionswahl bei der Bearbeitung des Similarity Join. Inform., Forsch. Entwickl. 17(2): 68-76 (2002) | |
| 25 | Christian Böhm, Hans-Peter Kriegel, Thomas Seidl: Combining Approximation Techniques and Vector Quantization for Adaptable Similarity Search. J. Intell. Inf. Syst. 19(2): 207-230 (2002) | |
| 24 | Christian Böhm, Hans-Peter Kriegel: Determining the Convex Hull in Large Multidimensional Databases. DaWaK 2001: 294-306 | |
| 23 | Christian Böhm, Hans-Peter Kriegel, Thomas Seidl: Adaptable Similarity Search Using Vector Quantization. DaWaK 2001: 317-327 | |
| 22 | Christian Böhm, Hans-Peter Kriegel: A Cost Model and Index Architecture for the Similarity Join. ICDE 2001: 411-420 | |
| 21 | Stefan Berchtold, Christian Böhm, Daniel A. Keim, Florian Krebs, Hans-Peter Kriegel: On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces. ICDT 2001: 435-449 | |
| 20 | Christian Böhm, Bernhard Braunmüller, Florian Krebs, Hans-Peter Kriegel: Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data. SIGMOD Conference 2001: 379-388 | |
| 18 | Christian Böhm, Bernhard Braunmüller, Hans-Peter Kriegel, Matthias Schubert: Efficient Similarity Search in Digital Libraries. ADL 2000: 193-199 | |
| 17 | Christian Böhm, Bernhard Braunmüller, Markus M. Breunig, Hans-Peter Kriegel: High Performance Clustering Based on the Similarity Join. CIKM 2000: 298-305 | |
| 16 | Stefan Berchtold, Christian Böhm, Daniel A. Keim, Hans-Peter Kriegel, Xiaowei Xu: Optimal Multidimensional Query Processing Using Tree Striping. DaWaK 2000: 244-257 | |
| 15 | Christian Böhm, Bernhard Braunmüller, Hans-Peter Kriegel: The Pruning Power: Theory and Heuristics for Mining Databases with Multiple k-Nearest-Neighbor Queries. DaWaK 2000: 372-381 | |
| 14 | Christian Böhm, Hans-Peter Kriegel: Dynamically Optimizing High-Dimensional Index Structures. EDBT 2000: 36-50 | |
| 13 | Stefan Berchtold, Christian Böhm, H. V. Jagadish, Hans-Peter Kriegel, Jörg Sander: Independent Quantization: An Index Compression Technique for High-Dimensional Data Spaces. ICDE 2000: 577-588 | |
| 11 | Christian Böhm, Stefan Berchtold, Hans-Peter Kriegel, Urs Michel: Multidimensional Index Structures in Relational Databases. J. Intell. Inf. Syst. 15(1): 51-70 (2000) | |
| 10 | Christian Böhm, Hans-Peter Kriegel: Efficient Bulk Loading of Large High-Dimensional Indexes. DaWaK 1999: 251-260 | |
| 9 | Stefan Berchtold, Christian Böhm, Hans-Peter Kriegel, Urs Michel: Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases. DaWaK 1999: 261-270 | |
| 8 | Christian Böhm, Gerald Klump, Hans-Peter Kriegel: XZ-Ordering: A Space-Filling Curve for Objects with Spatial Extension. SSD 1999: 75-90 | |
| 6 | Stefan Berchtold, Christian Böhm, Hans-Peter Kriegel: Improving the Query Performance of High-Dimensional Index Structures by Bulk-Load Operations. EDBT 1998: 216-230 | |
| 5 | Stefan Berchtold, Christian Böhm, Hans-Peter Kriegel: The Pyramid-Technique: Towards Breaking the Curse of Dimensionality. SIGMOD Conference 1998: 142-153 | |
| 3 | Stefan Berchtold, Christian Böhm, Daniel A. Keim, Hans-Peter Kriegel: A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space. PODS 1997: 78-86 | |
| 2 | Stefan Berchtold, Christian Böhm, Bernhard Braunmüller, Daniel A. Keim, Hans-Peter Kriegel: Fast Parallel Similarity Search in Multimedia Databases. SIGMOD Conference 1997: 1-12 |
Selection of 32 from 97 records - Christian Böhm has 100 coauthors
Last update 2012-09-10 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page