2084 search results - page 79 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
ICDM
2003
IEEE
15 years 3 months ago
2003
IEEE
Abstract. We present a new distributed association rule mining (D-ARM) algorithm that demonstrates superlinear speed-up with the number of computing nodes. The algorithm is the fi...
SRDS
1999
IEEE
15 years 2 months ago
1999
IEEE
Numerous mathematical approaches have been proposed to determine the optimal checkpoint interval for minimizing total execution time of an application in the presence of failures....
ECCC
2000
14 years 9 months ago
2000
We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC’s)), and various ensembles of random codes, ar...