Welcome to D
SIGMOD 2003
PODS 2003
SIGMOD-RECOR
ADBIS
CIDR 2003
CIKM 2003
DASFAA 2003
Data Enginee
DEBS
DMKD 2003
DOLAP 2003
DPDJ 2003
ER
GIS 2003
Hypertext 20
ICDE 2003
ICDM 2003
ICDT 2003
JCDL 2003
KRDB 2003
MIR 2003
MIS 2003
MMDB 2003
RIDE 2003
SBBD 2003
SIGIR 2003
SIGIR-FORUM
SIGKDD 2003
SIGKDD-EXP
SSDBM 2003
TIME 2003
TODS
VLDB 2003
VLDB Journal
WIDM 2003
About DiSC 2
Editorial Bo
Acknowledgem
DiSC 2004 Pr
ADVIS
DiSC'04 Feed
DiSC'04 Site
Search DiSC'
<<<Author Index>>>
Copyright No

Thomas Seidl

Papers on DiSC'04


Spatial Query Processing for High Resolutions

Effective Similarity Search on Voxelized CAD Object

Publications


Note: Links lead to the DBLP on the Web.

Thomas Seidl

Hans-Peter Kriegel , Martin Pfeifle , Marco Pötke , Thomas Seidl: A Cost Model for Spatial Intersection Queries on RI-Trees. DASFAA 2004 : 331-338

Karin Kailing , Hans-Peter Kriegel , Stefan Schönauer , Thomas Seidl: Efficient Similarity Search for Hierarchical Data in Large Databases. EDBT 2004 : 676-693

Karin Kailing , Hans-Peter Kriegel , Stefan Schönauer , Thomas Seidl: Efficient Similarity Search in Large Databases of Tree Structured Objects. ICDE 2004 : 835-836

Jost Enderle , Matthias Hampel , Thomas Seidl: Joining Interval Data in Relational Databases. SIGMOD Conference 2004

Hans-Peter Kriegel , Martin Pfeifle , Marco Pötke , Thomas Seidl: The Paradigm of Relational Indexing: a Survey. BTW 2003 : 285-304

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

Hans-Peter Kriegel , Martin Pfeifle , Marco Pötke , Thomas Seidl: Spatial Query Processing for High Resolutions. DASFAA 2003 : 17-26

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-

Hans-Peter Kriegel , Martin Pfeifle , Marco Pötke , Thomas Seidl: A Cost Model for Interval Intersection Queries on RI-Trees. SSDBM 2002 : 131-141

Christian Böhm , Hans-Peter Kriegel , Thomas Seidl: Combining Approximation Techniques and Vector Quantization for Adaptable Similarity Search. J. Intell. Inf. Syst. 19 (2): 207-230 (2002)

Christian Böhm , Hans-Peter Kriegel , Thomas Seidl: Adaptable Similarity Search Using Vector Quantization. DaWaK 2001 : 317-327

Hans-Peter Kriegel , Andreas Müller , Marco Pötke , Thomas Seidl: DIVE: Database Integration for Virtual Engineering. ICDE Demo Sessions 2001 : 15-16

Hans-Peter Kriegel , Andreas Müller , Marco Pötke , Thomas Seidl: Spatial Data Management for Computer Aided Design. SIGMOD Conference 2001

Hans-Peter Kriegel , Marco Pötke , Thomas Seidl: Interval Sequences: An Object-Relational Approach to Manage Spatial Data. SSTD 2001 : 481-501

Hans-Peter Kriegel , Marco Pötke , Thomas Seidl: Object-Relational Indexing for General Interval Relationships. SSTD 2001 : 522-542

Hans-Peter Kriegel , Marco Pötke , Thomas Seidl: Managing Intervals Efficiently in Object-Relational Databases. VLDB 2000 : 407-418

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. IEEE Trans. Knowl. Data Eng. 12 (1): 45- (2000)

Mihael Ankerst , Gabi Kastenmüller , Hans-Peter Kriegel , Thomas Seidl: Nearest Neighbor Classification in 3D Protein Databases. ISMB 1999 : 34-43

Mihael Ankerst , Gabi Kastenmüller , Hans-Peter Kriegel , Thomas Seidl: 3D Shape Histograms for Similarity Search and Classification in Spatial Databases. SSD 1999 : 207-226

Thomas Seidl, Hans-Peter Kriegel : Adaptable Similarity Search in Large Image Databases. State-of-the-Art in Content-Based Image and Video Retrieval 1999 : 297-317

Rolf Backofen , François Bry , Peter Clote , Hans-Peter Kriegel , Thomas Seidl, Klaus U. Schulz : Bioinformatik - Aktuelles Schlagwort. Informatik Spektrum 22 (5): 376-378 (1999)

Stefan Berchtold , Bernhard Ertl , Daniel A. Keim , Hans-Peter Kriegel , Thomas Seidl: Fast Nearest Neighbor Search in High-Dimensional Space. ICDE 1998 : 209-218

Thomas Seidl, Hans-Peter Kriegel : Optimal Multi-Step k-Nearest Neighbor Search. SIGMOD Conference 1998 : 154-165

Mihael Ankerst , Bernhard Braunmüller , Hans-Peter Kriegel , Thomas Seidl: Improving Adaptable Similarity Query Processing by Using Approximations. VLDB 1998 : 206-217

Thomas Seidl: Adaptable Similarity Search in 3-D Spatial Database Systems (Abstract). Datenbank Rundbrief 21 : 96 (1998)

Hans-Peter Kriegel , Thomas Seidl: Approximation-Based Similarity Search for 3-D Surface Segments. GeoInformatica 2 (2): 113-147 (1998)

Mihael Ankerst , Hans-Peter Kriegel , Thomas Seidl: A Multistep Approach for Shape Similarity Search in Image Databases. IEEE Trans. Knowl. Data Eng. 10 (6): 996-1004 (1998)

Hans-Peter Kriegel , Thomas Schmidt , Thomas Seidl: 3D Similarity Search by Shape Approximation. SSD 1997 : 11-28

Thomas Seidl, Hans-Peter Kriegel : Efficient User-Adaptable Similarity Search in Large Multimedia Databases. VLDB 1997 : 506-515

Martin Ester , Hans-Peter Kriegel , Thomas Seidl, Xiaowei Xu : Formbasierte Suche nach komplementären 3D-Oberflächen in einer Protein-Datenbank. BTW 1995 : 373-382

Thomas Seidl, Hans-Peter Kriegel : Solvent Accessible Surface Representation in a Database System for Protein Docking. ISMB 1995 : 350-358

Thomas Seidl, Hans-Peter Kriegel : A 3D Molecular Surface Representation Supporting Neighborhood Queries. SSD 1995 : 240-258

Daniel A. Keim , Hans-Peter Kriegel , Thomas Seidl: Supporting Data Mining of Large Databases by Visual Feedback Queries. ICDE 1994 : 302-313

Daniel A. Keim , Hans-Peter Kriegel , Thomas Seidl: Visual Feedback in Querying Large Databases. IEEE Visualization 1993 : 158-165

1 [ 8 ] [ 11 ] [ 16 ] [ 17 ]

2 [ 14 ]

3 [ 13 ] [ 18 ]

4 [ 24 ] [ 25 ]

5 [ 11 ]

6 [ 14 ]

7 [ 14 ]

8 [ 31 ]

9 [ 13 ]

10 [ 5 ]

11 [ 31 ]

12 [ 32 ] [ 33 ]

13 [ 16 ] [ 17 ]

14 [ 1 ] [ 2 ] [ 13 ] [ 18 ]

15 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 11 ] [ 12 ] [ 13 ] [ 14 ] [ 15 ] [ 16 ] [ 17 ] [ 18 ] [ 19 ] [ 20 ] [ 21 ] [ 22 ] [ 23 ] [ 24 ] [ 25 ] [ 26 ] [ 27 ] [ 28 ] [ 29 ] [ 30 ] [ 32 ] [ 33 ] [ 34 ]

16 [ 27 ]

17 [ 27 ]

18 [ 22 ] [ 23 ]

19 [ 26 ] [ 27 ] [ 28 ] [ 29 ] [ 30 ] [ 34 ]

20 [ 19 ] [ 20 ] [ 21 ] [ 22 ] [ 23 ] [ 26 ] [ 27 ] [ 28 ] [ 29 ] [ 30 ] [ 34 ]

21 [ 29 ]

22 [ 7 ]

23 [ 32 ] [ 33 ]

24 [ 14 ]

25 [ 5 ]




©2004 Association for Computing Machinery