356 search results - page 35 / 72 » Revisiting the Paxos Algorithm |
PODS
2008
ACM
14 years 7 months ago
2008
ACM
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
APPROX
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
IMC
2010
ACM
13 years 5 months ago
2010
ACM
Network management applications require accurate estimates of a wide range of flow-level traffic metrics. Given the inadequacy of current packet-sampling-based solutions, several ...
DCC
2007
IEEE
14 years 7 months ago
2007
IEEE
The low-density attack proposed by Lagarias and Odlyzko is a powerful algorithm against the subset sum problem. The improvement algorithm due to Coster et al. would solve almost a...
ESAS
2004
Springer
14 years 24 days ago
2004
Springer
The common perception of public key cryptography is that it is complex, slow and power hungry, and as such not at all suitable for use in ultra-low power environments like wireless...