162 search results - page 8 / 33 » Parallel frequent set counting |
CINQ
2004
Springer
14 years 1 months ago
2004
Springer
Mining Frequent Itemsets is the core operation of many data mining algorithms. This operation however, is very data intensive and sometimes produces a prohibitively large output. I...
DIALM
2007
ACM
13 years 11 months ago
2007
ACM
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
We present the Data Parallel Fortran (DPF) benchmark suite, a set of data parallel Fortran codes forevaluatingdata parallel compilers appropriatefor any target parallel architectu...
ASPDAC
2008
ACM
13 years 9 months ago
2008
ACM
Content addressable memory (CAM) is frequently used in applications, such as lookup tables, databases, associative computing, and networking, that require high-speed searches due t...
IISWC
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— The Intel Threading Building Blocks (TBB) runtime library [1] is a popular C++ parallelization environment [2][3] that offers a set of methods and templates for creatin...