2084 search results - page 395 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
133
Voted
FCT
2009
Springer
15 years 9 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
112
click to vote
SDM
2009
SIAM
15 years 11 months ago
2009
SIAM
Recent research in frequent pattern mining (FPM) has shifted from obtaining the complete set of frequent patterns to generating only a representative (summary) subset of frequent ...
104
Voted
HPCA
2009
IEEE
16 years 2 months ago
2009
IEEE
The verification of an execution against memory consistency is known to be NP-hard. This paper proposes a novel fast memory consistency verification method by identifying a new na...
128
click to vote
KDD
2007
ACM
16 years 2 months ago
2007
ACM
Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such...
122
Voted
COLT
2008
Springer
15 years 4 months ago
2008
Springer
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...