Sciweavers

750 search results - page 47 / 150
» Program Chair's Message
Sort
View
JCB
2000
129views more  JCB 2000»
13 years 7 months ago
Prediction of RNA Base Pairing Probabilities on Massively Parallel Computers
We present an implementation of McCaskill's algorithm for computing the base pair probabilities of an RNA molecule for massively parallel message passing architectures. The p...
Martin Fekete, Ivo L. Hofacker, Peter F. Stadler
IFIP
2009
Springer
14 years 2 months ago
Detecting Spam at the Network Level
Spam is increasingly a core problem affecting network security and performance. Indeed, it has been estimated that 80% of all email messages are spam. Content-based filters are a ...
Anna Sperotto, Gert Vliek, Ramin Sadre, Aiko Pras
COCO
2005
Springer
141views Algorithms» more  COCO 2005»
14 years 1 months ago
Upper Bounds for Quantum Interactive Proofs with Competing Provers
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
Gus Gutoski
IFIP
2004
Springer
14 years 1 months ago
Pattern-Matching Spi-Calculus
Cryptographic protocols often make use of nested cryptographic primitives, for example signed message digests, or encrypted signed messages. Gordon and Jeffrey’s prior work on ty...
Christian Haack, Alan Jeffrey
IFL
2003
Springer
14 years 1 months ago
Dynamic Chunking in Eden
Parallel programming generally requires awareness of the granularity and communication requirements of parallel subtasks, since without precaution, the overhead for parameter and r...
Jost Berthold