2084 search results - page 138 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
184
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
203
click to vote
STACS
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
180
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract-- A network of nodes communicate via noisy channels. Each node has some real-valued initial measurement or message. The goal of each of the nodes is to acquire an estimate...
154
click to vote
GLOBECOM
2008
IEEE
16 years 1 months ago
2008
IEEE
— This paper considers the scheduling problem in wireless networks. We focus on prioritized maximal scheduling, where a maximal scheduler chooses the links in an order specified...
158
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...