356 search results - page 15 / 72 » Revisiting the Paxos Algorithm |
132
click to vote
COMGEO
2002
ACM
15 years 1 months ago
2002
ACM
The goals of this paper are twofold. The first is to present a new sampling theory for curves, based on a new notion of local feature size. The properties of this new feature size...
106
click to vote
SIGECOM
2006
ACM
15 years 7 months ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
109
click to vote
ALGORITHMICA
2010
15 years 1 months ago
2010
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...
101
click to vote
RECOMB
2005
Springer
16 years 1 months ago
2005
Springer
The study of genome rearrangements is an important tool in comparative genomics. This paper revisits the problem of sorting a multichromosomal genome by translocations, i.e. exchan...
132
click to vote
FSE
2003
Springer
15 years 6 months ago
2003
Springer
In this paper, we revisit the security of several message authentication code (MAC) algorithms based on block ciphers, when instantiated with 64-bit block ciphers such as DES. We e...