Sciweavers

1229 search results - page 70 / 246
» On the gaussian distribution of strings
Sort
View
PLDI
2010
ACM
15 years 5 months ago
Smooth interpretation
We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of ...
Swarat Chaudhuri, Armando Solar-Lezama
103
Voted
STOC
2005
ACM
101views Algorithms» more  STOC 2005»
15 years 6 months ago
The round complexity of two-party random selection
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
Saurabh Sanghvi, Salil P. Vadhan
83
Voted
APPROX
2008
Springer
99views Algorithms» more  APPROX 2008»
15 years 2 months ago
A 2-Source Almost-Extractor for Linear Entropy
We give an explicit construction of a function that is almost a 2-source extractor for linear entropy, it is a condenser where the output has almost full entropy. Given 2 sources w...
Anup Rao
89
Voted
CORR
2010
Springer
62views Education» more  CORR 2010»
15 years 24 days ago
Guessing Revisited: A Large Deviations Approach
The problem of guessing a random string is revisited and some prior results on guessing exponents are re-derived using the theory of large deviations. It is shown that if the seque...
Manjesh Kumar Hanawal, Rajesh Sundaresan
95
Voted
CSB
2005
IEEE
139views Bioinformatics» more  CSB 2005»
15 years 6 months ago
Using Parallel Algorithms for Searching Molecular Sequence Databases
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
Carla Correa Tavares dos Reis, Rubem P. Mondaini