Sciweavers

204 search results - page 18 / 41
» Sketching Sampled Data Streams
Sort
View
ICDE
2007
IEEE
161views Database» more  ICDE 2007»
14 years 1 months ago
How to scalably and accurately skip past streams
Data stream methods look at each new item of the stream, perform a small number of operations while keeping a small amount of memory, and still perform muchneeded analyses. Howeve...
Supratik Bhattacharyya, André Madeira, S. M...
JMLR
2010
182views more  JMLR 2010»
13 years 2 months ago
Decision Tree for Dynamic and Uncertain Data Streams
Current research on data stream classification mainly focuses on certain data, in which precise and definite value is usually assumed. However, data with uncertainty is quite natu...
Chunquan Liang, Yang Zhang, Qun Song
ASIACRYPT
2000
Springer
13 years 11 months ago
Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers
In 1980 Hellman introduced a general technique for breaking arbitrary block ciphers with N possible keys in time T and memory M related by the tradeoff curve TM2 = N2 for 1 T N. ...
Alex Biryukov, Adi Shamir
EDBT
2008
ACM
171views Database» more  EDBT 2008»
14 years 7 months ago
Replay-based approaches to revision processing in stream query engines
Data stream processing systems have become ubiquitous in academic and commercial sectors, with application areas that include financial services, network traffic analysis, battlef...
Anurag Maskey, Mitch Cherniack
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
14 years 7 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner