Sciweavers

588 search results - page 40 / 118
» Reducibility and Completeness in Private Computations
Sort
View
IPPS
1998
IEEE
14 years 2 months ago
Update Protocols and Iterative Scientific Applications
Software DSMs have been a research topic for over a decade. While good performance has been achieved in some cases, consistent performance has continued to elude researchers. This...
Peter J. Keleher
BMCBI
2006
129views more  BMCBI 2006»
13 years 10 months ago
Fast index based algorithms and software for matching position specific scoring matrices
Background: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs in nucleotide as well as amino acid sequences....
Michael Beckstette, Robert Homann, Robert Giegeric...
CASC
2010
Springer
153views Mathematics» more  CASC 2010»
13 years 6 months ago
Implementing Data Parallel Rational Multiple-Residue Arithmetic in Eden
Abstract. Residue systems present a well-known way to reduce computation cost for symbolic computation. However most residue systems are implemented for integers or polynomials. Th...
Oleg Lobachev, Rita Loogen
CRYPTO
2009
Springer
145views Cryptology» more  CRYPTO 2009»
14 years 4 months ago
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
We study the design of cryptographic primitives resilient to key-leakage attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject o...
Joël Alwen, Yevgeniy Dodis, Daniel Wichs
CORR
2006
Springer
119views Education» more  CORR 2006»
13 years 10 months ago
Clustering and Sharing Incentives in BitTorrent Systems
Peer-to-peer protocols play an increasingly instrumental role in Internet content distribution. It is therefore important to gain a complete understanding of how these protocols b...
Arnaud Legout, Nikitas Liogkas, Eddie Kohler, Lixi...