453 search results - page 15 / 91 » Tight bounds for the partial-sums problem |
SIAMDM
2010
13 years 3 months ago
2010
The firefighter problem is the following discrete-time game on a graph. Initially, a fire starts at a vertex of the graph. In each round, a firefighter protects one vertex not yet ...
BMCBI
2006
13 years 8 months ago
2006
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
WAW
2010
Springer
13 years 6 months ago
2010
Springer
We give an improved algorithm for computing personalized PageRank vectors with tight error bounds which can be as small as (n-p ) for any fixed positive integer p. The improved Pag...
WINE
2010
Springer
13 years 6 months ago
2010
Springer
der the issue of fair division of goods, using the cake cutting abstraction, and aim to bound the possible degradation in social welfare due to the fairness requirements. Previous...
COMSNETS
2012
12 years 4 months ago
2012
—In this paper, we investigate the problem of maximizing the throughput, i.e., achieving capacity, of Byzantine consensus in point-to-point networks, in which each link has a cap...