6437 search results - page 207 / 1288 » Parallel Algorithms for Arrangements |
119
click to vote
ICTAI
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
135
click to vote
PPOPP
2012
ACM
13 years 10 months ago
2012
ACM
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
111
click to vote
PPOPP
2005
ACM
15 years 8 months ago
2005
ACM
The goal of data mining algorithm is to discover useful information embedded in large databases. Frequent itemset mining and sequential pattern mining are two important data minin...
162
click to vote
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
Sorting is an important component of many applications, and parallel sorting algorithms have been studied extensively in the last three decades. One of the earliest parallel sorti...
133
click to vote
IPPS
2010
IEEE
15 years 1 months ago
2010
IEEE
Sorting is a commonly used process with a wide breadth of applications in the high performance computing field. Early research in parallel processing has provided us with comprehen...