5153 search results - page 569 / 1031 » Introduction to Randomized Algorithms |
173
click to vote
SAC
2010
ACM
16 years 1 months ago
2010
ACM
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
140
click to vote
CRYPTO
2009
Springer
16 years 1 months ago
2009
Springer
In the Hidden Number Problem (HNP), the goal is to find a hidden number s, when given p, g and access to an oracle that on query a returns the k most significant bits of s · ga ...
189
click to vote
BIBE
2005
IEEE
16 years 2 days ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
270
click to vote
STOC
1997
ACM
15 years 10 months ago
1997
ACM
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
196
click to vote
SODA
2003
ACM
15 years 7 months ago
2003
ACM
In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream Ä ¾ Ñ Ò using two passes and Ç´¯ ½ ÔÒÐÓ Ò´ÐÓ Ñ·ÐÓ...