40 search results - page 6 / 8 » Can Random Coin Flips Speed Up a Computer |
DSN
2004
IEEE
13 years 11 months ago
2004
IEEE
This paper presents a scalable mechanism, Fast Routing Table Recovery (FRTR), for detecting and correcting route inconsistencies between neighboring BGP routers. The large size of...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
The parallelization of two applications in symmetric cryptography is considered: block ciphering and a new method based on random sampling for the selection of basic substitution ...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
We introduce a new technique that can reduce any
higher-order Markov random field with binary labels into
a first-order one that has the same minima as the original.
Moreover, w...
SIGECOM
2003
ACM
14 years 26 days ago
2003
ACM
Combinatorial auctions, where bidders can bid on bundles of items are known to be desirable auction mechanisms for selling items that are complementary and/or substitutable. Howev...
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...