804 search results - page 32 / 161 » On the Termination of the Chase Algorithm |
106
Voted
CORR
2010
Springer
14 years 8 months ago
2010
Springer
Abstract— We investigate secret key generation for a “pairwise independent network” model in which every pair of terminals observes correlated sources which are independent o...
71
Voted
CORR
2010
Springer
14 years 8 months ago
2010
Springer
The F5 algorithm is presented by Faug`ere in 2002. However, Faug`ere have not provide the rigorous proofs so far. In this paper, we will give a new complete proof and hence reveal ...
EDBTW
2004
Springer
15 years 3 months ago
2004
Springer
In this paper we thoroughly analyze a distributed procedure for the problem of local database update in a network of database peers, useful for data exchange scenarios. The algorit...
89
Voted
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
94
Voted
SIAMCOMP
1998
14 years 10 months ago
1998
We present a consensus algorithm that combines unreliable failure detection and randomization, two well-known techniques for solving consensus in asynchronous systems with crash f...