Sciweavers

48 search results - page 3 / 10
» Fast Moment Estimation in Data Streams in Optimal Space
Sort
View
SIGMOD
2006
ACM
137views Database» more  SIGMOD 2006»
14 years 8 months ago
Optimal multi-scale patterns in time series streams
We introduce a method to discover optimal local patterns, which concisely describe the main trends in a time series. Our approach examines the time series at multiple time scales ...
Spiros Papadimitriou, Philip S. Yu
FOCS
2009
IEEE
14 years 3 months ago
The Data Stream Space Complexity of Cascaded Norms
Abstract— We consider the problem of estimating cascaded aggregates over a matrix presented as a sequence of updates in a data stream. A cascaded aggregate P ◦Q is defined by ...
T. S. Jayram, David P. Woodruff
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
14 years 1 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun
NIPS
2003
13 years 9 months ago
Fast Algorithms for Large-State-Space HMMs with Applications to Web Usage Analysis
In applying Hidden Markov Models to the analysis of massive data streams, it is often necessary to use an artificially reduced set of states; this is due in large part to the fac...
Pedro F. Felzenszwalb, Daniel P. Huttenlocher, Jon...
EDBT
2011
ACM
281views Database» more  EDBT 2011»
12 years 12 months ago
Fast and accurate computation of equi-depth histograms over data streams
Equi-depth histograms represent a fundamental synopsis widely used in both database and data stream applications, as they provide the cornerstone of many techniques such as query ...
Hamid Mousavi, Carlo Zaniolo