Sciweavers

10 search results - page 2 / 2
» Law of large numbers for increasing subsequences of random p...
Sort
View
BMCBI
2010
124views more  BMCBI 2010»
13 years 6 months ago
Estimation and efficient computation of the true probability of recurrence of short linear protein sequence motifs in unrelated
Background: Large datasets of protein interactions provide a rich resource for the discovery of Short Linear Motifs (SLiMs) that recur in unrelated proteins. However, existing met...
Norman E. Davey, Richard J. Edwards, Denis C. Shie...
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
13 years 11 months ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky
STOC
2007
ACM
105views Algorithms» more  STOC 2007»
14 years 6 months ago
Balanced allocations: the weighted case
We investigate balls-and-bins processes where m weighted balls are placed into n bins using the "power of two choices" paradigm, whereby a ball is inserted into the less...
Kunal Talwar, Udi Wieder
BMCBI
2007
123views more  BMCBI 2007»
13 years 6 months ago
Tracembler - software for in-silico chromosome walking in unassembled genomes
Background: Whole genome shotgun sequencing produces increasingly higher coverage of a genome with random sequence reads. Progressive whole genome assembly and eventual finishing ...
Qunfeng Dong, Matthew D. Wilkerson, Volker Brendel
ANTS
2000
Springer
133views Algorithms» more  ANTS 2000»
13 years 10 months ago
Lifting Elliptic Curves and Solving the Elliptic Curve Discrete Logarithm Problem
Abstract. Essentially all subexponential time algorithms for the discrete logarithm problem over nite elds are based on the index calculus idea. In proposing cryptosystems based on...
Ming-Deh A. Huang, Ka Lam Kueh, Ki-Seng Tan