Sciweavers

534 search results - page 4 / 107
» Power from Random Strings
Sort
View
COCO
2004
Springer
78views Algorithms» more  COCO 2004»
14 years 23 days ago
Language Compression and Pseudorandom Generators
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...
Harry Buhrman, Troy Lee, Dieter van Melkebeek
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
CPC
2008
74views more  CPC 2008»
13 years 7 months ago
An Analysis of the Height of Tries with Random Weights on the Edges
We analyze the weighted height of random tries built from independent strings of i.i.d. symbols on the finite alphabet {1, . . . , d}. The edges receive random weights whose distr...
Nicolas Broutin, Luc Devroye
ICC
2007
IEEE
14 years 1 months ago
A Simple Power Margin Quality Measure for Correlated Random Variates Derived from the Normal Distribution
—This paper provides a power-margin-based measure of the quality of computer-generated random variates having a distribution that derives from the multivariate Gaussian distribut...
David J. Young, Norman C. Beaulieu
PSB
2003
13 years 8 months ago
MAP: Searching Large Genome Databases
A number of biological applications require comparison of large genome strings. Current techniques suffer from both disk I/O and computational cost because of extensive memory req...
Tamer Kahveci, Ambuj K. Singh