1038 search results - page 133 / 208 » Space-Bounded Query Approximation |
147
click to vote
MICAI
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
129
click to vote
VLDB
2004
ACM
15 years 9 months ago
2004
ACM
Histograms and Wavelet synopses provide useful tools in query optimization and approximate query answering. Traditional histogram construction algorithms, such as V-Optimal, optim...
156
click to vote
SSDBM
1999
IEEE
15 years 8 months ago
1999
IEEE
We address the problem of similarity search in large time series databases. We introduce a novel indexing algorithm that allows faster retrieval. The index is formed by creating b...
151
click to vote
CINQ
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
129
click to vote
ESA
2000
Springer
15 years 8 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...