Sciweavers

356 search results - page 15 / 72
» Revisiting the Paxos Algorithm
Sort
View
COMGEO
2002
ACM
13 years 6 months ago
Combinatorial curve reconstruction in Hilbert spaces: A new sampling theory and an old result revisited
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...
Daniel Freedman
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
14 years 21 days ago
Nash equilibria in graphical games on trees revisited
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...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
ALGORITHMICA
2010
155views more  ALGORITHMICA 2010»
13 years 6 months ago
Bin Packing with Rejection Revisited
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...
Leah Epstein
RECOMB
2005
Springer
14 years 7 months ago
On Sorting by Translocations
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...
Anne Bergeron, Julia Mixtacki, Jens Stoye
FSE
2003
Springer
135views Cryptology» more  FSE 2003»
13 years 12 months ago
New Attacks against Standardized MACs
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...
Antoine Joux, Guillaume Poupard, Jacques Stern