1612 search results - page 76 / 323 » Analysing Randomized Distributed Algorithms |
COLT
2010
Springer
14 years 7 months ago
2010
Springer
In 1994, Y. Mansour conjectured that for every DNF formula on n variables with t terms there exists a polynomial p with tO(log(1/)) non-zero coefficients such that Ex{0,1}n [(p(x)...
TON
2010
14 years 4 months ago
2010
We study the contention/interaction among wireless nodes and med -ium access control design in game theory framework. We define a general class of games, called random access game...
AAAI
2008
15 years 4 days ago
2008
In this paper, we present a general data clustering algorithm which is based on the asymmetric pairwise measure of Markov random walk hitting time on directed graphs. Unlike tradi...
EUC
2006
Springer
15 years 1 months ago
2006
Springer
In this paper, we propose a hierarchical architecture for grouping peers into clusters in a large-scale BitTorrent-like underlying overlay network in such a way that clusters are e...
AUTOMATICA
2002
14 years 9 months ago
2002
The objective of this paper is twofold. First, the problem of generation of real random matrix samples with uniform distribution in structured (spectral) norm bounded sets is stud...