Sciweavers

109 search results - page 11 / 22
» Bounds on Memory Bandwidth in Streamed Computations
Sort
View
SDM
2009
SIAM
164views Data Mining» more  SDM 2009»
14 years 4 months ago
Time-Decayed Correlated Aggregates over Data Streams.
Data stream analysis frequently relies on identifying correlations and posing conditional queries on the data after it has been seen. Correlated aggregates form an important examp...
Graham Cormode, Srikanta Tirthapura, Bojian Xu
SC
2004
ACM
14 years 1 months ago
Analysis and Performance Results of a Molecular Modeling Application on Merrimac
The Merrimac supercomputer uses stream processors and a highradix network to achieve high performance at low cost and low power. The stream architecture matches the capabilities o...
Mattan Erez, Jung Ho Ahn, Ankit Garg, William J. D...
DSN
2007
IEEE
13 years 11 months ago
Bounding Peer-to-Peer Upload Traffic in Client Networks
Peer-to-peer technique has now become one of the major techniques to exchange digital content between peers of the same interest. However, as the amount of peer-topeer traffic inc...
Chun-Ying Huang, Chin-Laung Lei
SIAMCOMP
2002
152views more  SIAMCOMP 2002»
13 years 7 months ago
Maintaining Stream Statistics over Sliding Windows
We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding wind...
Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev...
ADC
2008
Springer
156views Database» more  ADC 2008»
14 years 1 months ago
Interactive Mining of Frequent Itemsets over Arbitrary Time Intervals in a Data Stream
Mining frequent patterns in a data stream is very challenging for the high complexity of managing patterns with bounded memory against the unbounded data. While many approaches as...
Ming-Yen Lin, Sue-Chen Hsueh, Sheng-Kun Hwang