( en | de | ru )

 

Disambiguation of "Hans-Peter, Kriegel"

Author of the publication

copydeleteadd this publication to your clipboard
The X-tree: An Index Structure for High-Dimensional Data

, , and . (1996)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Hans-Peter Kriegel

Hans-Peter Kriegel

Hans-Peter Kriegel

Hans-Peter Kriegel

Hans-Peter Kriegel

 

Other publications of authors with the same name

Indexing uncertain spatio-temporal data., , , , and . CIKM, page 395-404. ACM, (2012)Homogene Triangulation von Polygonen und deren Einbettung in einen Anfrageprozessor für Raumobjekte., , and . Grundlagen von Datenbanken, volume Ni. 90-02 of Informatik-Berichte TU Braunschweig, page 53-54. TU Braunschweig, (1990)Eine effiziente und robuste Zugriffsstruktur für große Mengen polygonaler Objekte., and . Grundlagen von Datenbanken, volume Ni. 90-02 of Informatik-Berichte TU Braunschweig, page 55-56. TU Braunschweig, (1990)The isotopic fingerprint: new methods of data mining and similarity search, , , and . Across the Alps in Prehistory, Springer, (2017)Fast and Scalable Outlier Detection with Approximate Nearest Neighbor Ensembles., , and . DASFAA (2), volume 9050 of Lecture Notes in Computer Science, page 19-36. Springer, (2015)Class Prediction from Time Series Gene Expression Profiles Using Dynamical Systems Kernels., , and . Pacific Symposium on Biocomputing, page 547-558. World Scientific, (2006)VGM: visual graph mining., , and . SIGMOD Conference, page 733-735. ACM, (2006)VisDB: A System for Visualizing Large Databases., and . SIGMOD Conference, page 482. ACM Press, (1995)Spatial Outlier Detection: Data, Algorithms, Visualizations., , , , and . SSTD, volume 6849 of Lecture Notes in Computer Science, page 512-516. Springer, (2011)Multidimensional Dynamic Quantile Hashing is Very Efficient for Non-Uniform Record Distributions., and . ICDE, page 10-17. IEEE Computer Society, (1987)