Seguir
Christian Böhm
Christian Böhm
Professor of Computer Science, University of Vienna, Vienna, Austria
Dirección de correo verificada de univie.ac.at - Página principal
Título
Citado por
Citado por
Año
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
12922001
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
8291998
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
5771997
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
3902010
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
2842000
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
2471997
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
2392004
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
2362004
Search for the Decay of the Higgs Boson to Charm Quarks with the ATLAS Experiment
M Aaboud, G Aad, B Abbott, B Abeloos, SH Abidi, OS AbouZeid, ...
Physical review letters 120 (21), 211802, 2018
2022018
The k-Nearest Neighbour Join: Turbo Charging the KDD Process
C Böhm, F Krebs
Knowledge and Information Systems 6, 728-749, 2004
1992004
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
1772006
Alignment of the ATLAS inner detector in Run 2
G Aad, B Abbott, DC Abbott, AA Abud, K Abeling, DK Abhayasinghe, ...
The European Physical Journal C 80 (12), 1194, 2020
167*2020
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
1632001
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
1542000
Improving the query performance of high-dimensional index structures by bulk load operations
S Berchtold, C Böhm, HP Kriegel
Advances in Database Technology—EDBT'98: 6th International Conference on …, 1998
1501998
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
1482006
Robinia pseudoacacia L.: A Lesser Known Tree Species for Biomass Production
H Grünewald, C Böhm, A Quinkenstein, P Grundmann, J Eberts, ...
BioEnergy Research 2, 123-133, 2009
1472009
Excess risk of urinary tract cancers in patients receiving thiopurines for inflammatory bowel disease: a prospective observational cohort study
A Bourrier, F Carrat, JF Colombel, AM Bouvier, V Abitbol, P Marteau, ...
Alimentary pharmacology & therapeutics 43 (2), 252-261, 2016
1362016
Possible routes for cluster growth and particle formation in RF silane discharges
J Perrin, C Bohm, R Etemadi, A Lloret
Plasma Sources Science and Technology 3 (3), 252, 1994
1361994
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
1312009
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20