Sciweavers

1170 search results - page 185 / 234
» How Fast Is Too Fast
Sort
View
117
Voted
JOC
2008
92views more  JOC 2008»
15 years 2 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
JCP
2006
128views more  JCP 2006»
15 years 2 months ago
A Service Oriented Framework for Multimedia Radio Networks
- In order to enable fast deployment of new emerging services over multimedia radio networks, it is important to design an efficient service-based platform with necessary traffic m...
Asma Ben Letaifa, Sami Tabbane, Zièd Chouka...
EOR
2007
73views more  EOR 2007»
15 years 2 months ago
Complete and robust no-fit polygon generation for the irregular stock cutting problem
The no-fit polygon is a construct that can be used between pairs of shapes for fast and efficient handling of geometry within irregular two-dimensional stock cutting problems. Pre...
Edmund K. Burke, Robert S. R. Hellier, Graham Kend...
KAIS
2006
164views more  KAIS 2006»
15 years 2 months ago
On efficiently summarizing categorical databases
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
Jianyong Wang, George Karypis
SIAMJO
2008
72views more  SIAMJO 2008»
15 years 2 months ago
A Sample Approximation Approach for Optimization with Probabilistic Constraints
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...
James Luedtke, Shabbir Ahmed