158 search results - page 8 / 32 » Simple Fast Parallel Hashing |
139
Voted
STACS
2012
Springer
13 years 7 months ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
90
Voted
KES
2004
Springer
15 years 5 months ago
2004
Springer
Association rule mining is an important data mining problem that has been studied extensively. In this paper, a simple but Fast algorithm for Intersecting attribute lists using a ...
100
click to vote
CIKM
1998
Springer
15 years 3 months ago
1998
Springer
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
164
click to vote
CRYPTO
1999
Springer
15 years 4 months ago
1999
Springer
We describe a message authentication algorithm, UMAC, which can authenticate messages (in software, on contemporary machines) roughly an order of magnitude faster than current prac...
106
Voted
ICDCS
2002
IEEE
15 years 4 months ago
2002
IEEE
We present a generic module, called Fast Collect. Fast Collect is an implementation of Single-Writer Multi-Reader (SWMR) Shared-Memory in an asynchronous system in which a process...