default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Pfeifle
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
- 2018
[c37]Nikola Karamanov, Desislav Andreev
, Martin Pfeifle, Hendrik Bock, Mathias Otto, Matthias Schulze:
Map Line Interface for Autonomous Driving. ITSC 2018: 26-33- 2014
- [i1]Eshref Januzaj, Hans-Peter Kriegel, Martin Pfeifle:
Scalable Density-Based Distributed Clustering. CoRR abs/1409.6548 (2014)
2000 – 2009
- 2007
- [c36]Jonghyun Suh, Sungwon Jung, Martin Pfeifle, Khoa T. Vo, Marcus Oswald, Gerhard Reinelt:
Compression of Digital Road Networks. SSTD 2007: 423-440 - 2006
- [j4]Stefan Brecheisen, Hans-Peter Kriegel, Martin Pfeifle:
Multi-step density-based clustering. Knowl. Inf. Syst. 9(3): 284-308 (2006) - [j3]Karin Kailing, Hans-Peter Kriegel, Martin Pfeifle, Stefan Schönauer:
Extending metric index structures for efficient range query processing. Knowl. Inf. Syst. 10(2): 211-227 (2006) - [c35]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
Probabilistic Similarity Join on Uncertain Data. DASFAA 2006: 295-309 - [c34]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
ViEWNet: Visual Exploration of Region-Wide Traffic Networks. ICDE 2006: 166 - [c33]Stefan Brecheisen, Hans-Peter Kriegel, Martin Pfeifle:
Parallel Density-Based Clustering of Complex Objects. PAKDD 2006: 179-188 - 2005
- [c32]Hans-Peter Kriegel, Martin Pfeifle:
Measuring the Quality of Approximated Clusterings. BTW 2005: 415-424 - [c31]Stefan Brecheisen, Hans-Peter Kriegel, Martin Pfeifle:
Efficient Similarity Search on Vector Sets. BTW 2005: 425-443 - [c30]Hans-Peter Kriegel, Martin Pfeifle:
Efficient and effective server-sided distributed clustering. CIKM 2005: 339-340 - [c29]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
Distributed Intersection Join of Complex Interval Sequences. DASFAA 2005: 748-760 - [c28]Hans-Peter Kriegel, Martin Pfeifle:
Hierarchical Density-Based Clustering of Uncertain Data. ICDM 2005: 689-692 - [c27]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
Efficient Join Processing for Complex Rasterized Objects. ICEIS 2005: 20-30 - [c26]Hans-Peter Kriegel, Martin Pfeifle:
Density-based clustering of uncertain data. KDD 2005: 672-677 - [c25]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
Database Support for Haptic Exploration in Very Large Virtual Environments. MMM 2005: 352-357 - [c24]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
Approximated Clustering of Distributed High-Dimensional Data. PAKDD 2005: 432-441 - [c23]Hans-Peter Kriegel, Martin Pfeifle:
Clustering Moving Objects via Medoid Clusterings. SSDBM 2005: 153-162 - [c22]Hans-Peter Kriegel, Martin Pfeifle:
Fuzzy Decomposition of Spatially Extended Objects. SSDBM 2005: 293-296 - [p1]Hans-Peter Kriegel, Martin Pfeifle, Marco Pötke, Thomas Seidl, Jost Enderle:
Object-Relational Spatial Indexing. Spatial Databases 2005: 49-80 - 2004
- [b1]Martin Pfeifle:
Spatial database support for virtual engineering. Ludwig Maximilian University of Munich, Germany, 2004, pp. 1-346 - [j2]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) - [j1]Hans-Peter Kriegel, Martin Pfeifle, Stefan Schönauer:
Similarity Search in Biological and Engineering Databases. IEEE Data Eng. Bull. 27(4): 37-44 (2004) - [c21]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
Statistic Driven Acceleration of Object-Relational Space-Partitioning Index Structures. DASFAA 2004: 169-183 - [c20]Hans-Peter Kriegel, Martin Pfeifle, Marco Pötke, Thomas Seidl:
A Cost Model for Spatial Intersection Queries on RI-Trees. DASFAA 2004: 331-338 - [c19]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
Effective Decompositioning of Complex Spatial Objects into Intervals. Databases and Applications 2004: 19-24 - [c18]Eshref Januzaj, Hans-Peter Kriegel, Martin Pfeifle:
A Quality Measure for Distributed Clustering. Databases and Applications 2004: 133-138 - [c17]Eshref Januzaj, Hans-Peter Kriegel, Martin Pfeifle:
DBDC: Density Based Distributed Clustering. EDBT 2004: 88-105 - [c16]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
Object-relational management of complex geographical objects. GIS 2004: 109-117 - [c15]Stefan Brecheisen, Hans-Peter Kriegel, Peer Kröger, Martin Pfeifle, Maximilian Viermetz, Marco Pötke:
BOSS: Browsing OPTICS-Plots for Similarity Search. ICDE 2004: 858 - [c14]Stefan Brecheisen, Hans-Peter Kriegel, Martin Pfeifle:
Efficient Density-Based Clustering of Complex Objects. ICDM 2004: 43-50 - [c13]Eshref Januzaj, Hans-Peter Kriegel, Martin Pfeifle:
Scalable Density-Based Distributed Clustering. PKDD 2004: 231-244 - [c12]Stefan Brecheisen, Hans-Peter Kriegel, Peer Kröger, Martin Pfeifle:
Visually Mining through Cluster Hierarchies. SDM 2004: 400-411 - [c11]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
Efficient Query Processing on Relational Data-Partitioning Index Structures. SSDBM 2004: 119-122 - [c10]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
Spatial Join for High-Resolution Objects. SSDBM 2004: 151-160 - 2003
- [c9]Hans-Peter Kriegel, Martin Pfeifle, Marco Pötke, Matthias Renz, Thomas Seidl:
Spatial Data Management for Virtual Product Development. Computer Science in Perspective 2003: 216-230 - [c8]Hans-Peter Kriegel, Martin Pfeifle, Marco Pötke, Thomas Seidl:
The Paradigm of Relational Indexing: a Survey. BTW 2003: 285-304 - [c7]Hans-Peter Kriegel, Martin Pfeifle, Marco Pötke, Thomas Seidl:
Spatial Query Processing for High Resolutions. DASFAA 2003: 17-26 - [c6]Hans-Peter Kriegel, Peer Kröger, Zahi Mashael, Martin Pfeifle, Marco Pötke, Thomas Seidl:
Effective Similarity Search on Voxelized CAD Object. DASFAA 2003: 27-36 - [c5]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
Efficient Query Processing on the Relational Quadtree. GEOINFO 2003 - [c4]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz, Petra-Maria Strauß:
Stochastic Driven Relational R-Tree. GEOINFO 2003 - [c3]Hans-Peter Kriegel, Stefan Brecheisen, Peer Kröger, Martin Pfeifle, Matthias Schubert:
Using Sets of Feature Vectors for Similarity Search on Voxelized CAD Objects. SIGMOD Conference 2003: 587-598 - [c2]Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, Matthias Renz:
Acceleration of Relational Index Structures Based on Statistics. SSDBM 2003: 258-261 - 2002
- [c1]Hans-Peter Kriegel, Martin Pfeifle, Marco Pötke, Thomas Seidl:
A Cost Model for Interval Intersection Queries on RI-Trees. SSDBM 2002: 131-141
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-24 22:46 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:
