Sciweavers

454 search results - page 3 / 91
» On the approximation error in high dimensional model represe...
Sort
View
SIGMOD
2001
ACM
184views Database» more  SIGMOD 2001»
14 years 7 months ago
Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
Eamonn J. Keogh, Kaushik Chakrabarti, Sharad Mehro...
DASFAA
2008
IEEE
150views Database» more  DASFAA 2008»
14 years 1 months ago
Approximate Clustering of Time Series Using Compact Model-Based Descriptions
Clustering time series is usually limited by the fact that the length of the time series has a significantly negative influence on the runtime. On the other hand, approximative c...
Hans-Peter Kriegel, Peer Kröger, Alexey Pryak...
CVPR
1997
IEEE
14 years 9 months ago
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
Jeffrey S. Beis, David G. Lowe
PAKDD
2005
ACM
112views Data Mining» more  PAKDD 2005»
14 years 25 days ago
Approximated Clustering of Distributed High-Dimensional Data
In many modern application ranges high-dimensional feature vectors are used to model complex real-world objects. Often these objects reside on different local sites. In this paper,...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
VVS
1995
IEEE
132views Visualization» more  VVS 1995»
13 years 11 months ago
Multi-Dimensional Trees for Controlled Volume Rendering and Compression
This paper explores the use of multi-dimensional trees to provide spatial and temporal e ciencies in imaging large data sets. Each node of the tree contains a model of the data in...
Jane Wilhelms, Allen Van Gelder