2084 search results - page 197 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
134
Voted
BMCBI
2008
15 years 2 months ago
2008
Background: Confidence in pairwise alignments of biological sequences, obtained by various methods such as Blast or Smith-Waterman, is critical for automatic analyses of genomic d...
129
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
129
Voted
ICPP
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper discusses the techniques of performing distributed page ranking on top of structured peer-to-peer networks. Distributed page ranking are needed because the size of the ...
131
Voted
FPGA
2008
ACM
15 years 4 months ago
2008
ACM
This paper introduces a method of constructing random number generators from four of the basic primitives provided by FPGAs: Flip-Flips, Lookup-Tables, Shift Registers, and RAMs. ...
113
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...