Sciweavers

313 search results - page 13 / 63
» New Streaming Algorithms for Fast Detection of Superspreader...
Sort
View
WDAG
1995
Springer
109views Algorithms» more  WDAG 1995»
14 years 3 days ago
Faster Possibility Detection by Combining Two Approaches
Abstract. A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss Φ (read “possibly Φ”), meaning the...
Scott D. Stoller, Fred B. Schneider
SIGMOD
2006
ACM
219views Database» more  SIGMOD 2006»
14 years 8 months ago
Modeling skew in data streams
Data stream applications have made use of statistical summaries to reason about the data using nonparametric tools such as histograms, heavy hitters, and join sizes. However, rela...
Flip Korn, S. Muthukrishnan, Yihua Wu
FSE
2005
Springer
153views Cryptology» more  FSE 2005»
14 years 2 months ago
F-FCSR: Design of a New Class of Stream Ciphers
In this paper we present a new class of stream ciphers based on a very simple mechanism. The heart of our method is a Feedback with Carry Shift Registers (FCSR) automaton. This au...
François Arnault, Thierry P. Berger
CIKM
2010
Springer
13 years 7 months ago
Partial drift detection using a rule induction framework
The major challenge in mining data streams is the issue of concept drift, the tendency of the underlying data generation process to change over time. In this paper, we propose a g...
Damon Sotoudeh, Aijun An
CRYPTO
2003
Springer
156views Cryptology» more  CRYPTO 2003»
14 years 1 months ago
Fast Algebraic Attacks on Stream Ciphers with Linear Feedback
Many popular stream ciphers apply a filter/combiner to the state of one or several LFSRs. Algebraic attacks on such ciphers [10, 11] are possible, if there is a multivariate relat...
Nicolas Courtois