622 search results - page 12 / 125 » Fast Computation of Large Distributions and Its Cryptographi... |
BMCBI
2010
14 years 11 months ago
2010
Background: Improving the accuracy and efficiency of motif recognition is an important computational challenge that has application to detecting transcription factor binding sites...
104
click to vote
FM
2006
Springer
15 years 3 months ago
2006
Springer
Security-critical systems are an important application area for formal methods. However, such systems often contain cryptographic subsystems. The natural definitions of these subsy...
ANCS
2007
ACM
15 years 3 months ago
2007
ACM
Scheduling in large switches is challenging. Arbiters must operate at high rates to keep up with the high switching rates demanded by multi-gigabit-per-second link rates and short...
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
Generalized Belief Propagation (gbp) has proven to be a promising technique for performing inference on Markov random fields (mrfs). However, its heavy computational cost and large...
FTDCS
2003
IEEE
15 years 5 months ago
2003
IEEE
Recently, the scheme of parallel downloading (PD) has been adopted by a number of Internet file downloading applications. With the wide deployment of content distribution network...