23 search results - page 4 / 5 » A Parallel Algorithm for Sampling Matchings from an Almost U... |
WEA
2010
Springer
14 years 2 months ago
2010
Springer
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
CONCUR
1997
Springer
13 years 11 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
MIDDLEWARE
2009
Springer
13 years 12 months ago
2009
Springer
Today’s distributed systems need runtime error detection to catch errors arising from software bugs, hardware errors, or unexpected operating conditions. A prominent class of err...
PODC
2009
ACM
14 years 8 months ago
2009
ACM
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
IPL
2006
13 years 7 months ago
2006
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...