Christian Böhm
Christian Böhm
Professor for Computer Science, Ludwig-Maximilians-Universität München (LMU, University of Munich)
Email verificata su dbs.ifi.lmu.de - Home page
TitoloCitata daAnno
Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases
C Böhm, S Berchtold, DA Keim
ACM Computing Surveys (CSUR) 33 (3), 322-373, 2001
11372001
The pyramid-technique: towards breaking the curse of dimensionality
S Berchtold, C Böhm, HP Kriegal
Proceedings of the 1998 ACM SIGMOD international conference on Management of …, 1998
7581998
A cost model for nearest neighbor search in high-dimensional data space
S Berchtold, C Böhm, DA Keim, HP Kriegel
Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on …, 1997
5311997
Independent quantization: An index compression technique for high-dimensional data spaces
S Berchtold, C Bohm, HV Jagadish, HP Kriegel, J Sander
Proceedings of 16th International Conference on Data Engineering (Cat. No …, 2000
2702000
Automated detection of brain atrophy patterns based on MRI for the prediction of Alzheimer's disease
C Plant, SJ Teipel, A Oswald, C Böhm, T Meindl, J Mourao-Miranda, ...
Neuroimage 50 (1), 162-174, 2010
2512010
Fast parallel similarity search in multimedia databases
S Berchtold, C Böhm, B Braunmüller, DA Keim, HP Kriegel
ACM SIGMOD Record 26 (2), 1-12, 1997
2341997
Computing clusters of correlation connected objects
C Böhm, K Kailing, P Kröger, A Zimek
Proceedings of the 2004 ACM SIGMOD international conference on Management of …, 2004
1992004
Density connected clustering with local subspace preferences
C Bohm, K Railing, HP Kriegel, P Kroger
Fourth IEEE International Conference on Data Mining (ICDM'04), 27-34, 2004
1882004
The k-Nearest Neighbour Join: Turbo Charging the KDD Process
C Böhm, F Krebs
Knowledge and Information Systems 6 (6), 728-749, 2004
1562004
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
E Achtert, C Böhm, P Kröger, P Kunath, A Pryakhin, M Renz
Proceedings of the 2006 ACM SIGMOD international conference on Management of …, 2006
1542006
A cost model for query processing in high dimensional data spaces
C Böhm
ACM Transactions on Database Systems (TODS) 25 (2), 129-178, 2000
1452000
The gauss-tree: Efficient object identification in databases of probabilistic feature vectors
C Bohm, A Pryakhin, M Schubert
22nd International Conference on Data Engineering (ICDE'06), 9-9, 2006
1362006
Epsilon grid order: An algorithm for the similarity join on massive high-dimensional data
C Böhm, B Braunmüller, F Krebs, HP Kriegel
ACM SIGMOD Record 30 (2), 379-388, 2001
1332001
Improving the query performance of high-dimensional index structures by bulk load operations
S Berchtold, C Böhm, HP Kriegel
International Conference on Extending Database Technology, 216-230, 1998
1271998
DeLi-Clu: boosting robustness, completeness, usability, and efficiency of hierarchical clustering by a closest pair ranking
E Achtert, C Böhm, P Kröger
Pacific-Asia Conference on Knowledge Discovery and Data Mining, 119-128, 2006
1032006
Density-based clustering using graphics processors
C Böhm, R Noll, C Plant, B Wackersreuther
Proceedings of the 18th ACM conference on Information and knowledge …, 2009
932009
Detection and visualization of subspace cluster hierarchies
E Achtert, C Böhm, HP Kriegel, P Kröger, I Müller-Gorman, A Zimek
International Conference on Database Systems for Advanced Applications, 152-163, 2007
872007
Robust, complete, and efficient correlation clustering
E Achtert, C Böhm, HP Kriegel, P Kröger, A Zimek
Proceedings of the 2007 SIAM International Conference on Data Mining, 413-418, 2007
802007
Determining the convex hull in large multidimensional databases
C Böhm, HP Kriegel
International Conference on Data Warehousing and Knowledge Discovery, 294-306, 2001
772001
A cost model and index architecture for the similarity join
C Bohm, HP Kriegel
Proceedings 17th International Conference on Data Engineering, 411-420, 2001
772001
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–20