168 search results - page 6 / 34 » Lower Bounds for Distributed Coin-Flipping and Randomized Co... |
APPROX
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
SPAA
1993
ACM
15 years 3 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
106
click to vote
COLT
2006
Springer
15 years 3 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
124
click to vote
DIALM
2005
ACM
15 years 1 months ago
2005
ACM
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—Cooperative spectrum sensing is attracting more attention in Cognitive Radio networks. This paper proposes a fully distributed consensus-based cooperative spectrum sensing schem...