5606 search results - page 207 / 1122 » Randomization Techniques for Graphs. |
96
Voted
ESA
2004
Springer
15 years 6 months ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
97
Voted
SIROCCO
2010
15 years 2 months ago
2010
Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...
105
Voted
COMBINATORICA
2007
15 years 22 days ago
2007
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...
106
Voted
EUROSYS
2006
ACM
15 years 9 months ago
2006
ACM
—Restoring data operations after a disaster is a daunting task: how should recovery be performed to minimize data loss and application downtime? Administrators are under consider...
69
Voted
CIC
2006
15 years 2 months ago
2006
In this paper the performance of OVSF and NOVSF codes in WCDMA are evaluated by calculating their blocking probability and plotting graphs between blocking probability and new call...