2084 search results - page 160 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
159
Voted
IPPS
2002
IEEE
15 years 10 months ago
2002
IEEE
The BMI Eigenvalue Problem is one of optimization problems and is to minimize the greatest eigenvalue of a bilinear matrix function. This paper proposes a parallel algorithm to co...
145
click to vote
COLT
2005
Springer
15 years 10 months ago
2005
Springer
We consider the problem of learning mixtures of distributions via spectral methods and derive a tight characterization of when such methods are useful. Specifically, given a mixt...
160
click to vote
SODA
2004
ACM
15 years 6 months ago
2004
ACM
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
69
Voted
CORR
2008
Springer
15 years 5 months ago
2008
Springer
The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and stat...
147
click to vote
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
In this paper we define the Weak Mutual Exclusion (WME) problem. Analogously to classical Distributed Mutual Exclusion (DME), WME serializes the accesses to a shared resource. Di...