2084 search results - page 153 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
145
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
—The implementation of distributed network utility maximization (NUM) algorithms hinges heavily on information feedback through message passing among network elements. In practic...
133
click to vote
STOC
2005
ACM
16 years 5 months ago
2005
ACM
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
141
click to vote
AI
2010
Springer
15 years 5 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
228
click to vote
VLDB
2007
ACM
16 years 5 months ago
2007
ACM
Existing work on similar sequence matching has focused on either whole matching or range subsequence matching. In this paper, we present novel methods for ranked subsequence match...
158
click to vote
WDAG
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...