Sciweavers

1632 search results - page 151 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
ICDM
2005
IEEE
271views Data Mining» more  ICDM 2005»
15 years 9 months ago
HOT SAX: Efficiently Finding the Most Unusual Time Series Subsequence
In this work, we introduce the new problem of finding time series discords. Time series discords are subsequences of a longer time series that are maximally different to all the r...
Eamonn J. Keogh, Jessica Lin, Ada Wai-Chee Fu
IUI
2005
ACM
15 years 9 months ago
The centrality of pivotal points in the evolution of scientific networks
In this paper, we describe the development of CiteSpace as an integrated environment for identifying and tracking thematic trends in scientific literature. The goal is to simplify...
Chaomei Chen
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
16 years 4 months ago
Optimal approximations of the frequency moments of data streams
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
Piotr Indyk, David P. Woodruff
KDD
2000
ACM
115views Data Mining» more  KDD 2000»
15 years 7 months ago
Mining asynchronous periodic patterns in time series data
Periodicy detection in time series data is a challenging problem of great importance in many applications. Most previous work focused on mining synchronous periodic patterns and d...
Jiong Yang, Wei Wang 0010, Philip S. Yu
DEDS
2010
130views more  DEDS 2010»
15 years 4 months ago
Message Batching in Wireless Sensor Networks - A Perturbation Analysis Approach
Abstract-- We address the problem of batching messages generated at nodes of a sensor network for the purpose of reducing communication energy at the expense of added latency. We f...
Xu Ning, Christos G. Cassandras