Sciweavers

4198 search results - page 21 / 840
» In search of lost time
Sort
View
JPDC
2002
104views more  JPDC 2002»
13 years 6 months ago
Fully dynamic distributed search trees can be balanced in O(lg2 N) time
In this paper we consider the dictionary problem in a message-passing distributed environment. We introduce a new version, based on AVL-trees, of distributed search trees, the fir...
Fabio Barillari, Enrico Nardelli, Massimo Pepe
TKDE
2008
178views more  TKDE 2008»
13 years 6 months ago
Efficient Similarity Search over Future Stream Time Series
With the advance of hardware and communication technologies, stream time series is gaining ever-increasing attention due to its importance in many applications such as financial da...
Xiang Lian, Lei Chen 0002
ICDM
2010
IEEE
276views Data Mining» more  ICDM 2010»
13 years 4 months ago
Accelerating Dynamic Time Warping Subsequence Search with GPUs and FPGAs
Many time series data mining problems require subsequence similarity search as a subroutine. While this can be performed with any distance measure, and dozens of distance measures ...
Doruk Sart, Abdullah Mueen, Walid A. Najjar, Eamon...
CIKM
2006
Springer
13 years 10 months ago
Measuring the meaning in time series clustering of text search queries
We use a combination of proven methods from time series analysis and machine learning to explore the relationship between temporal and semantic similarity in web query logs; we di...
Bing Liu 0003, Rosie Jones, Kristina Lisa Klinkner
SSDBM
2000
IEEE
128views Database» more  SSDBM 2000»
13 years 11 months ago
Supporting Content-Based Searches on Time Series via Approximation
Fast retrieval of time series in terms of their contents is important in many application domains. This paper studies database techniques supporting fast searches for time series ...
Changzhou Wang, Xiaoyang Sean Wang