46 search results - page 7 / 10 » Efficient k-NN search on vertically decomposed data |
170
click to vote
KDD
2002
ACM
16 years 6 months ago
2002
ACM
We introduce a new algorithm for mining sequential patterns. Our algorithm is especially efficient when the sequential patterns in the database are very long. We introduce a novel...
152
click to vote
EDBT
2004
ACM
16 years 6 months ago
2004
ACM
Abstract. Non-contiguous subsequence pattern queries search for symbol instances in a long sequence that satisfy some soft temporal constraints. In this paper, we propose a methodo...
225
click to vote
CORR
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
174
click to vote
PVLDB
2008
15 years 5 months ago
2008
In this paper we propose a novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions. These restrictions may be relaxed at a ...
151
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
Automatic unloading of piled box-like objects is undoubtedly of great importance to the industry. In this contribution a system addressing this problem is described: We employ a l...