515 search results - page 32 / 103 » Subsequence Matching on Structured Time Series Data |
CIKM
2005
Springer
14 years 2 months ago
2005
Springer
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
ACIVS
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Functional magnetic resonance (fMRI) data are often corrupted with colored noise. To account for this type of noise, many prewhitening and pre-coloring strategies have be...
ICDE
2000
IEEE
14 years 9 months ago
2000
IEEE
Time-series data, which are a series of one-dimensional real numbers, have been studied in various database applications. In this paper, we extend the traditional similarity searc...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...