default search action
Peter Kunath
Person information
- affiliation: Ludwig Maximilian University of Munich, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [r2]Hans-Peter Kriegel, Peter Kunath, Matthias Renz:
R*-Tree. Encyclopedia of GIS 2017: 1717-1724
2000 – 2009
- 2008
- [c39]Johannes Aßfalg, Michael Kats, Hans-Peter Kriegel, Peter Kunath, Alexey Pryakhin:
Index-Supported Similarity Search Using Multiple Representations. DASFAA 2008: 504-511 - [c38]Hans-Peter Kriegel, Peter Kunath, Alexey Pryakhin, Matthias Schubert:
MUSE: Multi-Represented Similarity Estimation. ICDE 2008: 1340-1342 - [c37]Hans-Peter Kriegel, Peer Kröger, Peter Kunath, Matthias Renz, Tim Schmidt:
Efficient Query Processing in Large Traffic Networks. ICDE 2008: 1451-1453 - [c36]Johannes Aßfalg, Hans-Peter Kriegel, Peer Kröger, Peter Kunath, Alexey Pryakhin, Matthias Renz:
T-Time: Threshold-Based Data Mining on Time Series. ICDE 2008: 1620-1623 - [c35]Johannes Aßfalg, Hans-Peter Kriegel, Peer Kröger, Peter Kunath, Alexey Pryakhin, Matthias Renz:
Similarity Search in Multimedia Time Series Data Using Amplitude-Level Features. MMM 2008: 123-133 - [c34]Hans-Peter Kriegel, Peter Kunath, Alexey Pryakhin, Matthias Schubert:
Distribution-Based Similarity for Multi-represented Multimedia Objects. MMM 2008: 155-164 - [r1]Hans-Peter Kriegel, Peter Kunath, Matthias Renz:
R*-Tree. Encyclopedia of GIS 2008: 987-992 - 2007
- [j3]Elke Achtert, Christian Böhm, Peer Kröger, Peter Kunath, Alexey Pryakhin, Matthias Renz:
Efficient reverse k-nearest neighbor estimation. Inform. Forsch. Entwickl. 21(3-4): 179-195 (2007) - [c33]Christian Böhm, Peter Kunath, Alexey Pryakhin, Matthias Schubert:
Effective and Efficient Indexing for Large Video Databases. BTW 2007: 132-151 - [c32]Elke Achtert, Christian Böhm, Peer Kröger, Peter Kunath, Alexey Pryakhin, Matthias Renz:
Efficient Reverse k-Nearest Neighbor Estimation. BTW 2007: 344-363 - [c31]Hans-Peter Kriegel, Peter Kunath, Matthias Renz:
Probabilistic Nearest-Neighbor Query on Uncertain Objects. DASFAA 2007: 337-348 - [c30]Johannes Aßfalg, Hans-Peter Kriegel, Peer Kröger, Peter Kunath, Alexey Pryakhin, Matthias Renz:
Interval-Focused Similarity Search in Time Series Databases. DASFAA 2007: 586-597 - [c29]Hans-Peter Kriegel, Peer Kröger, Peter Kunath, Matthias Renz, Tim Schmidt:
Proximity queries in large traffic networks. GIS 2007: 21 - [c28]Otmar Hilliges
, Peter Kunath, Alexey Pryakhin, Andreas Butz, Hans-Peter Kriegel:
Browsing and Sorting Digital Pictures Using Automatic Image Classification and Quality Analysis. HCI (3) 2007: 882-891 - [c27]Christian Böhm, Michael Gruber, Peter Kunath, Alexey Pryakhin, Matthias Schubert:
ProVeR: Probabilistic Video Retrieval using the Gauss-Tree. ICDE 2007: 1521-1522 - [c26]Hans-Peter Kriegel, Peer Kröger, Peter Kunath, Matthias Renz:
Generalizing the Optimality of Multi-step k -Nearest Neighbor Query Processing. SSTD 2007: 75-92 - [c25]Christian Böhm, Peter Kunath, Alexey Pryakhin, Matthias Schubert:
Querying Objects Modeled by Arbitrary Probability Distributions. SSTD 2007: 294-311 - 2006
- [b1]Peter Kunath:
Efficient analysis in multimedia databases. Ludwig Maximilian University of Munich, Germany, 2006, pp. 1-250 - [j2]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) - [c24]Johannes Aßfalg, Hans-Peter Kriegel, Peer Kröger, Peter Kunath, Alexey Pryakhin, Matthias Renz:
Semi-Supervised Threshold Queries on Pharmacogenomics Time Sequences. APBC 2006: 307-316 - [c23]Elke Achtert, Christian Böhm, Peer Kröger, Peter Kunath, Alexey Pryakhin, Matthias Renz:
Approximate reverse k-nearest neighbor queries in general metric spaces. CIKM 2006: 788-789 - [c22]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
Probabilistic Similarity Join on Uncertain Data. DASFAA 2006: 295-309 - [c21]Johannes Aßfalg, Hans-Peter Kriegel, Peer Kröger, Peter Kunath, Alexey Pryakhin, Matthias Renz:
Similarity Search on Time Series Based on Threshold Queries. EDBT 2006: 276-294 - [c20]Johannes Aßfalg, Hans-Peter Kriegel, Peer Kröger, Peter Kunath, Alexey Pryakhin, Matthias Renz:
TQuEST: Threshold Query Execution for Large Sets of Time Series. EDBT 2006: 1147-1150 - [c19]Stefan Brecheisen, Hans-Peter Kriegel, Peter Kunath, Alexey Pryakhin, Florian Vorberger:
MUSCLE: Music Classification Engine with User Feedback. EDBT 2006: 1164-1167 - [c18]Johannes Aßfalg, Hans-Peter Kriegel, Peer Kröger, Peter Kunath, Alexey Pryakhin, Matthias Renz:
Threshold Similarity Queries in Large Time Series Databases. ICDE 2006: 149 - [c17]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
ViEWNet: Visual Exploration of Region-Wide Traffic Networks. ICDE 2006: 166 - [c16]Stefan Brecheisen, Hans-Peter Kriegel, Peter Kunath, Alexey Pryakhin:
Hierarchical Genre Classification for Large Music Collections. ICME 2006: 1385-1388 - [c15]Hans-Peter Kriegel, Peer Kröger, Peter Kunath, Alexey Pryakhin:
Effective similarity search in multimedia databases using multiple representations. MMM 2006 - [c14]Elke Achtert, Christian Böhm, Peer Kröger, Peter Kunath, Alexey Pryakhin, Matthias Renz:
Efficient reverse k-nearest neighbor search in arbitrary metric spaces. SIGMOD Conference 2006: 515-526 - [c13]Johannes Aßfalg, Hans-Peter Kriegel, Peer Kröger, Peter Kunath, Alexey Pryakhin, Matthias Renz:
Time Series Analysis Using the Concept of Adaptable Threshold Similarity. SSDBM 2006: 251-260 - 2005
- [c12]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
Distributed Intersection Join of Complex Interval Sequences. DASFAA 2005: 748-760 - [c11]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
Efficient Join Processing for Complex Rasterized Objects. ICEIS 2005: 20-30 - [c10]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
Database Support for Haptic Exploration in Very Large Virtual Environments. MMM 2005: 352-357 - [c9]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
Approximated Clustering of Distributed High-Dimensional Data. PAKDD 2005: 432-441 - 2004
- [j1]Stefan Brecheisen, Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
Der virtualle Prototyp: Datenbankunterstützung für CAD-Anwendungen. Datenbank-Spektrum 10(9): 22-29 (2004) - [c8]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
Statistic Driven Acceleration of Object-Relational Space-Partitioning Index Structures. DASFAA 2004: 169-183 - [c7]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
Effective Decompositioning of Complex Spatial Objects into Intervals. Databases and Applications 2004: 19-24 - [c6]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
Object-relational management of complex geographical objects. GIS 2004: 109-117 - [c5]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
Efficient Query Processing on Relational Data-Partitioning Index Structures. SSDBM 2004: 119-122 - [c4]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
Spatial Join for High-Resolution Objects. SSDBM 2004: 151-160 - 2003
- [c3]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
Efficient Query Processing on the Relational Quadtree. GEOINFO 2003 - [c2]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz, Petra-Maria Strauß:
Stochastic Driven Relational R-Tree. GEOINFO 2003 - [c1]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
Acceleration of Relational Index Structures Based on Statistics. SSDBM 2003: 258-261
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: