Sciweavers

1362 search results - page 69 / 273
» Means, Correlations and Bounds
Sort
View
JOC
2008
92views more  JOC 2008»
15 years 1 months ago
Cryptanalysis of an E0-like Combiner with Memory
In this paper, we study an E0-like combiner with memory as the keystream generator. First, we formulate a systematic and simple method to compute correlations of the FSM output seq...
Yi Lu 0002, Serge Vaudenay
ICDM
2009
IEEE
134views Data Mining» more  ICDM 2009»
14 years 11 months ago
Efficient Discovery of Confounders in Large Data Sets
Given a large transaction database, association analysis is concerned with efficiently finding strongly related objects. Unlike traditional associate analysis, where relationships ...
Wenjun Zhou, Hui Xiong
139
Voted
PODS
2005
ACM
164views Database» more  PODS 2005»
16 years 1 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt
MOC
2002
118views more  MOC 2002»
15 years 1 months ago
The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...
Fred J. Hickernell, Xiaoqun Wang
PODS
2007
ACM
171views Database» more  PODS 2007»
16 years 1 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei