6437 search results - page 111 / 1288 » Parallel Algorithms for Arrangements |
108
click to vote
COMPGEOM
2006
ACM
15 years 6 months ago
2006
ACM
We describe an implementation of a compact parallel algorithm for 3D Delaunay tetrahedralization on a 64-processor shared-memory machine. Our algorithm uses a concurrent version o...
132
click to vote
SBACPAD
2003
IEEE
15 years 6 months ago
2003
IEEE
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
120
Voted
IPL
2002
15 years 11 days ago
2002
One of the main reasons for using parallel evolutionary algorithms (PEAs) is to obtain efficient algorithms with an execution time much lower than that of their sequential counter...
101
Voted
FOCS
1991
IEEE
15 years 4 months ago
1991
IEEE
The Lov´asz Local Lemma is a tool that enables one to show that certain events hold with positive, though very small probability. It often yields existence proofs of results with...
92
Voted
ENTCS
2008
15 years 23 days ago
2008
We argue in this paper that benchmarking should be complemented by direct measurement of parallelisation overheads when evaluating parallel state-space exploration algorithms. Thi...