Sciweavers

16666 search results - page 2949 / 3334
» Descriptive and Computational Complexity
Sort
View
JACM
2006
98views more  JACM 2006»
15 years 6 months ago
Distribution sort with randomized cycling
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
Jeffrey Scott Vitter, David A. Hutchinson
JOC
2008
92views more  JOC 2008»
15 years 6 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
JOT
2008
122views more  JOT 2008»
15 years 6 months ago
UML and Object Oriented Drama
Readers of this article have probably seen, at least once, diagrams produced using the UML (Unified Modeling Language). Some of you have perhaps used UML for your own work and kno...
Luca Vetti Tagliati, Carlo Caloro
221
Voted
JCM
2006
112views more  JCM 2006»
15 years 6 months ago
A Peer-to-Peer Cooperation Enhancement Scheme and its Performance Analysis
The performance of peer-to-peer systems depends on the level of cooperation of the system's participants. While most existing peer-to-peer architectures have assumed that user...
Wei-Cherng Liao, Fragkiskos Papadopoulos, Konstant...
DKE
2007
105views more  DKE 2007»
15 years 6 months ago
On compressing frequent patterns
A major challenge in frequent-pattern mining is the sheer size of its mining results. To compress the frequent patterns, we propose to cluster frequent patterns with a tightness m...
Dong Xin, Jiawei Han, Xifeng Yan, Hong Cheng
« Prev « First page 2949 / 3334 Last » Next »