Sciweavers

247 search results - page 26 / 50
» Extracting All the Randomness from a Weakly Random Source
Sort
View
BMCBI
2007
154views more  BMCBI 2007»
13 years 7 months ago
Bounds on the distribution of the number of gaps when circles and lines are covered by fragments: Theory and practical applicati
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
John Moriarty, Julian R. Marchesi, Anthony Metcalf...
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 6 months ago
Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
Sirin Nitinawarat, Prakash Narayan
FOCS
2007
IEEE
14 years 1 months ago
Cryptography from Sunspots: How to Use an Imperfect Reference String
The Common Reference String (CRS) model equips all protocol participants with a common string that is sampled from a pre-specified distribution, say the uniform distribution. Thi...
Ran Canetti, Rafael Pass, Abhi Shelat
SEC
2008
13 years 9 months ago
Hiding in Groups: On the Expressiveness of Privacy Distributions
Many applications inherently disclose information because perfect privacy protection is prohibitively expensive. RFID tags, for example, cannot be equipped with the cryptographic p...
Karsten Nohl, David Evans
ECCV
2008
Springer
14 years 9 months ago
Keypoint Signatures for Fast Learning and Recognition
Abstract. Statistical learning techniques have been used to dramatically speed-up keypoint matching by training a classifier to recognize a specific set of keypoints. However, the ...
Michael Calonder, Vincent Lepetit, Pascal Fua