6105 search results - page 126 / 1221 » A Parallel Algorithm for Bound-Smoothing |
167
click to vote
SBACPAD
2003
IEEE
15 years 10 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...
147
click to vote
FOCS
1991
IEEE
15 years 8 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...
131
Voted
ENTCS
2008
15 years 5 months 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...
140
click to vote
PAAPP
2006
15 years 4 months ago
2006
Abstract: In this paper, we present a new, easy to implement algorithm for detecting the termination of a parallel asynchronous computation on distributedmemory MIMD computers. We ...
150
click to vote
BMCBI
2010
15 years 5 months ago
2010
Background: DNA signatures are distinct short nucleotide sequences that provide valuable information that is used for various purposes, such as the design of Polymerase Chain Reac...