Sciweavers

40 search results - page 6 / 8
» On Estimating Frequency Moments of Data Streams
Sort
View
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
ISCI
2006
145views more  ISCI 2006»
13 years 8 months ago
Processing count queries over event streams at multiple time granularities
Management and analysis of streaming data has become crucial with its applications in web, sensor data, network traffic data, and stock market. Data streams consist of mostly nume...
Aykut Ünal, Yücel Saygin, Özgü...
ICDM
2009
IEEE
146views Data Mining» more  ICDM 2009»
14 years 3 months ago
Induction of Mean Output Prediction Trees from Continuous Temporal Meteorological Data
: In this paper, we present a novel method for fast data-driven construction of regression trees from temporal datasets including continuous data streams. The proposed Mean Output ...
Dima Alberg, Mark Last, Roni Neuman, Avi Sharon
ICCAD
2006
IEEE
95views Hardware» more  ICCAD 2006»
14 years 5 months ago
Robust estimation of parametric yield under limited descriptions of uncertainty
Reliable prediction of parametric yield for a specific design is difficult; a significant reason is the reliance of the yield estimation methods on the hard-to-measure distributio...
Wei-Shen Wang, Michael Orshansky
DAWAK
2006
Springer
14 years 7 days ago
An Approximate Approach for Mining Recently Frequent Itemsets from Data Streams
Recently, the data stream, which is an unbounded sequence of data elements generated at a rapid rate, provides a dynamic environment for collecting data sources. It is likely that ...
Jia-Ling Koh, Shu-Ning Shin