The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Thomas Seidl: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Thomas Seidl, Hans-Peter Kriegel
    Efficient User-Adaptable Similarity Search in Large Multimedia Databases. [Citation Graph (11, 21)][DBLP]
    VLDB, 1997, pp:506-515 [Conf]
  2. Thomas Seidl, Hans-Peter Kriegel
    Optimal Multi-Step k-Nearest Neighbor Search. [Citation Graph (8, 24)][DBLP]
    SIGMOD Conference, 1998, pp:154-165 [Conf]
  3. Daniel A. Keim, Hans-Peter Kriegel, Thomas Seidl
    Supporting Data Mining of Large Databases by Visual Feedback Queries. [Citation Graph (6, 8)][DBLP]
    ICDE, 1994, pp:302-313 [Conf]
  4. Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, Hans-Peter Kriegel, Thomas Seidl
    Fast Nearest Neighbor Search in High-Dimensional Space. [Citation Graph (5, 14)][DBLP]
    ICDE, 1998, pp:209-218 [Conf]
  5. Hans-Peter Kriegel, Thomas Schmidt, Thomas Seidl
    3D Similarity Search by Shape Approximation. [Citation Graph (4, 0)][DBLP]
    SSD, 1997, pp:11-28 [Conf]
  6. Mihael Ankerst, Bernhard Braunmüller, Hans-Peter Kriegel, Thomas Seidl
    Improving Adaptable Similarity Query Processing by Using Approximations. [Citation Graph (2, 23)][DBLP]
    VLDB, 1998, pp:206-217 [Conf]
  7. Hans-Peter Kriegel, Thomas Seidl
    Approximation-Based Similarity Search for 3-D Surface Segments. [Citation Graph (2, 0)][DBLP]
    GeoInformatica, 1998, v:2, n:2, pp:113-147 [Journal]
  8. Hans-Peter Kriegel, Martin Pfeifle, Marco Pötke, Matthias Renz, Thomas Seidl
    Spatial Data Management for Virtual Product Development. [Citation Graph (0, 0)][DBLP]
    Computer Science in Perspective, 2003, pp:216-230 [Conf]
  9. Christoph Brochhaus, Jost Enderle, Achim Schlosser, Thomas Seidl, Knut Stolze
    Integrating the Relational Interval Tree into IBM's DB2 Universal Database Server. [Citation Graph (0, 0)][DBLP]
    BTW, 2005, pp:67-86 [Conf]
  10. Martin Ester, Hans-Peter Kriegel, Thomas Seidl, Xiaowei Xu
    Formbasierte Suche nach komplementären 3D-Oberflächen in einer Protein-Datenbank. [Citation Graph (0, 0)][DBLP]
    BTW, 1995, pp:373-382 [Conf]
  11. Hans-Peter Kriegel, Martin Pfeifle, Marco Pötke, Thomas Seidl
    The Paradigm of Relational Indexing: a Survey. [Citation Graph (0, 0)][DBLP]
    BTW, 2003, pp:285-304 [Conf]
  12. M. Tamer Özsu, Jean Carrive, Sébastien Gilles, Izabela Grasland, Roger Mohr, Thomas Seidl
    CVDB 2004 Panel: Future Applications and Solutions. [Citation Graph (0, 0)][DBLP]
    CVDB, 2004, pp:67-68 [Conf]
  13. Thomas Seidl
    Nearest Neighbor Search on Multimedia Indexing Structures. [Citation Graph (0, 0)][DBLP]
    CVDB, 2004, pp:2- [Conf]
  14. Thomas Seidl, Hans-Peter Kriegel
    Adaptable Similarity Search in Large Image Databases. [Citation Graph (0, 0)][DBLP]
    State-of-the-Art in Content-Based Image and Video Retrieval, 1999, pp:297-317 [Conf]
  15. Hans-Peter Kriegel, Peer Kröger, Zahi Mashael, Martin Pfeifle, Marco Pötke, Thomas Seidl
    Effective Similarity Search on Voxelized CAD Object. [Citation Graph (0, 0)][DBLP]
    DASFAA, 2003, pp:27-0 [Conf]
  16. Hans-Peter Kriegel, Martin Pfeifle, Marco Pötke, Thomas Seidl
    Spatial Query Processing for High Resolutions. [Citation Graph (0, 0)][DBLP]
    DASFAA, 2003, pp:17-26 [Conf]
  17. Hans-Peter Kriegel, Martin Pfeifle, Marco Pötke, Thomas Seidl
    A Cost Model for Spatial Intersection Queries on RI-Trees. [Citation Graph (0, 0)][DBLP]
    DASFAA, 2004, pp:331-338 [Conf]
  18. Christian Böhm, Hans-Peter Kriegel, Thomas Seidl
    Adaptable Similarity Search Using Vector Quantization. [Citation Graph (0, 0)][DBLP]
    DaWaK, 2001, pp:317-327 [Conf]
  19. Christoph Brochhaus, Marc Wichterich, Thomas Seidl
    Approximation Techniques to Enable Dimensionality Reduction for Voronoi-Based Nearest Neighbor Search. [Citation Graph (0, 0)][DBLP]
    EDBT, 2006, pp:204-221 [Conf]
  20. Karin Kailing, Hans-Peter Kriegel, Stefan Schönauer, Thomas Seidl
    Efficient Similarity Search for Hierarchical Data in Large Databases. [Citation Graph (0, 0)][DBLP]
    EDBT, 2004, pp:676-693 [Conf]
  21. Thomas Seidl, Gabi Kastenmüller, Hans-Peter Kriegel
    Similarity Search in 3D Protein Databases. [Citation Graph (0, 0)][DBLP]
    German Conference on Bioinformatics, 1998, pp:- [Conf]
  22. Ira Assent, Andrea Wenning, Thomas Seidl
    Approximation Techniques for Indexing the Earth Mover's Distance in Multimedia Databases. [Citation Graph (0, 0)][DBLP]
    ICDE, 2006, pp:11- [Conf]
  23. Karin Kailing, Hans-Peter Kriegel, Stefan Schönauer, Thomas Seidl
    Efficient Similarity Search in Large Databases of Tree Structured Objects. [Citation Graph (0, 0)][DBLP]
    ICDE, 2004, pp:835-836 [Conf]
  24. Hans-Peter Kriegel, Andreas Müller, Marco Pötke, Thomas Seidl
    DIVE: Database Integration for Virtual Engineering. [Citation Graph (0, 0)][DBLP]
    ICDE Demo Sessions, 2001, pp:15-16 [Conf]
  25. Ira Assent, Ralph Krieger, Boris Glavic, Thomas Seidl
    Spatial Multidimensional Sequence Clustering. [Citation Graph (0, 0)][DBLP]
    ICDM Workshops, 2006, pp:343-348 [Conf]
  26. Mihael Ankerst, Gabi Kastenmüller, Hans-Peter Kriegel, Thomas Seidl
    Nearest Neighbor Classification in 3D Protein Databases. [Citation Graph (0, 0)][DBLP]
    ISMB, 1999, pp:34-43 [Conf]
  27. Thomas Seidl, Hans-Peter Kriegel
    Solvent Accessible Surface Representation in a Database System for Protein Docking. [Citation Graph (0, 0)][DBLP]
    ISMB, 1995, pp:350-358 [Conf]
  28. Mohammed Javeed Zaki, Markus Peters, Ira Assent, Thomas Seidl
    CLICKS: an effective algorithm for mining subspace clusters in categorical datasets. [Citation Graph (0, 0)][DBLP]
    KDD, 2005, pp:736-742 [Conf]
  29. Jost Enderle, Matthias Hampel, Thomas Seidl
    Joining Interval Data in Relational Databases. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2004, pp:683-694 [Conf]
  30. Hans-Peter Kriegel, Andreas Müller, Marco Pötke, Thomas Seidl
    Spatial Data Management for Computer Aided Design. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2001, pp:614- [Conf]
  31. Mihael Ankerst, Gabi Kastenmüller, Hans-Peter Kriegel, Thomas Seidl
    3D Shape Histograms for Similarity Search and Classification in Spatial Databases. [Citation Graph (0, 0)][DBLP]
    SSD, 1999, pp:207-226 [Conf]
  32. Hans-Peter Kriegel, Marco Pötke, Thomas Seidl
    Interval Sequences: An Object-Relational Approach to Manage Spatial Data. [Citation Graph (0, 0)][DBLP]
    SSTD, 2001, pp:481-501 [Conf]
  33. Hans-Peter Kriegel, Marco Pötke, Thomas Seidl
    Object-Relational Indexing for General Interval Relationships. [Citation Graph (0, 0)][DBLP]
    SSTD, 2001, pp:522-542 [Conf]
  34. Thomas Seidl, Hans-Peter Kriegel
    A 3D Molecular Surface Representation Supporting Neighborhood Queries. [Citation Graph (0, 0)][DBLP]
    SSD, 1995, pp:240-258 [Conf]
  35. Hans-Peter Kriegel, Martin Pfeifle, Marco Pötke, Thomas Seidl
    A Cost Model for Interval Intersection Queries on RI-Trees. [Citation Graph (0, 0)][DBLP]
    SSDBM, 2002, pp:131-141 [Conf]
  36. Daniel A. Keim, Hans-Peter Kriegel, Thomas Seidl
    Visual Feedback in Querying Large Databases. [Citation Graph (0, 0)][DBLP]
    IEEE Visualization, 1993, pp:158-165 [Conf]
  37. Jost Enderle, Nicole Schneider, Thomas Seidl
    Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases. [Citation Graph (0, 0)][DBLP]
    VLDB, 2005, pp:385-396 [Conf]
  38. Hans-Peter Kriegel, Marco Pötke, Thomas Seidl
    Managing Intervals Efficiently in Object-Relational Databases. [Citation Graph (0, 0)][DBLP]
    VLDB, 2000, pp:407-418 [Conf]
  39. Ira Assent, Marc Wichterich, Thomas Seidl
    Adaptable Distance Functions for Similarity-based Multimedia Retrieval. [Citation Graph (0, 0)][DBLP]
    Datenbank-Spektrum, 2006, v:19, n:, pp:23-31 [Journal]
  40. Mohammed J. Zaki, Markus Peters, Ira Assent, Thomas Seidl
    Clicks: An effective algorithm for mining subspace clusters in categorical datasets. [Citation Graph (0, 0)][DBLP]
    Data Knowl. Eng., 2007, v:60, n:1, pp:51-70 [Journal]
  41. Thomas Seidl
    Adaptable Similarity Search in 3-D Spatial Database Systems (Abstract). [Citation Graph (0, 0)][DBLP]
    Datenbank Rundbrief, 1998, v:21, n:, pp:96- [Journal]
  42. Christoph Brochhaus, Jost Enderle, Achim Schlosser, Thomas Seidl, Knut Stolze
    Efficient interval management using object-relational database servers. [Citation Graph (0, 0)][DBLP]
    Inform., Forsch. Entwickl., 2005, v:20, n:3, pp:121-137 [Journal]
  43. Rolf Backofen, François Bry, Peter Clote, Hans-Peter Kriegel, Thomas Seidl, Klaus U. Schulz
    Bioinformatik - Aktuelles Schlagwort. [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 1999, v:22, n:5, pp:376-378 [Journal]
  44. Christian Böhm, Hans-Peter Kriegel, Thomas Seidl
    Combining Approximation Techniques and Vector Quantization for Adaptable Similarity Search. [Citation Graph (0, 0)][DBLP]
    J. Intell. Inf. Syst., 2002, v:19, n:2, pp:207-230 [Journal]
  45. Stefan Berchtold, Daniel A. Keim, Hans-Peter Kriegel, Thomas Seidl
    Indexing the Solution Space: A New Technique for Nearest Neighbor Search in High-Dimensional Space. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2000, v:12, n:1, pp:45-0 [Journal]
  46. Mihael Ankerst, Hans-Peter Kriegel, Thomas Seidl
    A Multistep Approach for Shape Similarity Search in Image Databases. [Citation Graph (0, 22)][DBLP]
    IEEE Trans. Knowl. Data Eng., 1998, v:10, n:6, pp:996-1004 [Journal]
  47. Ira Assent, Ralph Krieger, Thomas Seidl
    AttentionAttractor: efficient video stream similarity query processing in real time. [Citation Graph (0, 0)][DBLP]
    ICDE, 2007, pp:1509-1510 [Conf]
  48. Christoph Brochhaus, Thomas Seidl
    Efficient Index Support for View-Dependent Queries on CFD Data. [Citation Graph (0, 0)][DBLP]
    SSTD, 2007, pp:57-74 [Conf]
  49. Christoph Brochhaus, Thomas Seidl
    IndeGS: Index Supported Graphics Data Server for CFD Data Postprocessing. [Citation Graph (0, 0)][DBLP]
    VLDB, 2007, pp:1354-1357 [Conf]

  50. High-Dimensional Indexing for Multimedia Features. [Citation Graph (, )][DBLP]


  51. Metrische Anpassung der Earth Mover's Distanz zur Ähnlichkeitssuche in Multimedia-Datenbanken. [Citation Graph (, )][DBLP]


  52. EDSC: efficient density-based subspace clustering. [Citation Graph (, )][DBLP]


  53. Detection of orthogonal concepts in subspaces of high dimensional data. [Citation Graph (, )][DBLP]


  54. Exploring multimedia databases via optimization-based relevance feedback and the earth mover's distance. [Citation Graph (, )][DBLP]


  55. Signature Quadratic Form Distance. [Citation Graph (, )][DBLP]


  56. Subspace outlier mining in large multimedia databases. [Citation Graph (, )][DBLP]


  57. Efficient multi-step query processing for EMD-based similarity. [Citation Graph (, )][DBLP]


  58. Speeding Up Complex Video Copy Detection Queries. [Citation Graph (, )][DBLP]


  59. Air-Indexing on Error Prone Communication Channels. [Citation Graph (, )][DBLP]


  60. The TS-tree: efficient time series search and retrieval. [Citation Graph (, )][DBLP]


  61. Type-based categorization of relational attributes. [Citation Graph (, )][DBLP]


  62. Indexing density models for incremental learning and anytime classification on data streams. [Citation Graph (, )][DBLP]


  63. Pattern detector: fast detection of suspicious stream patterns for immediate reaction. [Citation Graph (, )][DBLP]


  64. Efficient similarity search using the Earth Mover's Distance for large multimedia databases. [Citation Graph (, )][DBLP]


  65. OutRank: ranking outliers in high dimensional data. [Citation Graph (, )][DBLP]


  66. Ranking multimedia databases via relevance feedback with history and foresight support. [Citation Graph (, )][DBLP]


  67. DUSC: Dimensionality Unbiased Subspace Clustering. [Citation Graph (, )][DBLP]


  68. INSCY: Indexing Subspace Clusters with In-Process-Removal of Redundancy. [Citation Graph (, )][DBLP]


  69. Self-Adaptive Anytime Stream Clustering. [Citation Graph (, )][DBLP]


  70. Relevant Subspace Clustering: Mining the Most Interesting Non-redundant Concepts in High Dimensional Data. [Citation Graph (, )][DBLP]


  71. A comparative study of similarity measures for content-based multimedia retrieval. [Citation Graph (, )][DBLP]


  72. Visual speaker model exploration. [Citation Graph (, )][DBLP]


  73. Morpheus: interactive exploration of subspace clustering. [Citation Graph (, )][DBLP]


  74. EDISKCO: energy efficient distributed in-sensor-network k-center clustering with outliers. [Citation Graph (, )][DBLP]


  75. Mobile Mining and Information Management in HealthNet Scenarios. [Citation Graph (, )][DBLP]


  76. Signature quadratic form distances for content-based similarity. [Citation Graph (, )][DBLP]


  77. SubClass: Classification of Multidimensional Noisy Data Using Subspace Clusters. [Citation Graph (, )][DBLP]


  78. Subgraph Mining on Directed and Weighted Graphs. [Citation Graph (, )][DBLP]


  79. Bulk Loading Hierarchical Mixture Models for Efficient Stream Classification. [Citation Graph (, )][DBLP]


  80. Pleiades: Subspace Clustering and Evaluation. [Citation Graph (, )][DBLP]


  81. Harnessing the Strengths of Anytime Algorithms for Constant Data Streams. [Citation Graph (, )][DBLP]


  82. SOREX: Subspace Outlier Ranking Exploration Toolkit. [Citation Graph (, )][DBLP]


  83. Subspace Clustering for Uncertain Data. [Citation Graph (, )][DBLP]


  84. DensEst: Density Estimation for Data Mining in High Dimensional Spaces. [Citation Graph (, )][DBLP]


  85. Efficient EMD-based similarity search in multimedia databases via flexible dimensionality reduction. [Citation Graph (, )][DBLP]


  86. IndeGSRI: Efficient View-Dependent Ranking in CFD Post- processing Queries with RDBMS. [Citation Graph (, )][DBLP]


  87. HSM: Heterogeneous Subspace Mining in High Dimensional Data. [Citation Graph (, )][DBLP]


  88. MC-Tree: Improving Bayesian Anytime Classification. [Citation Graph (, )][DBLP]


  89. Public microarray repository semantic annotation with ontologies employing text mining and expression profile correlation. [Citation Graph (, )][DBLP]


  90. Harnessing the strengths of anytime algorithms for constant data streams. [Citation Graph (, )][DBLP]


Search in 0.016secs, Finished in 0.019secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002