Sciweavers

Share
9 search results - page 1 / 2
» How to Get More Mileage from Randomness Extractors
Sort
View
COCO
2006
Springer
100views Algorithms» more  COCO 2006»
10 years 5 months ago
How to Get More Mileage from Randomness Extractors
Let C be a class of distributions over {0, 1}n . A deterministic randomness extractor for C is a function E : {0, 1}n {0, 1}m such that for any X in C the distribution E(X) is sta...
Ronen Shaltiel
NAACL
2003
10 years 2 months ago
Getting More Mileage from Web Text Sources for Conversational Speech Language Modeling using Class-Dependent Mixtures
Sources of training data suitable for language modeling of conversational speech are limited. In this paper, we show how training data can be supplemented with text from the web ...
Ivan Bulyko, Mari Ostendorf, Andreas Stolcke
FOCS
1999
IEEE
10 years 5 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
11 years 1 months ago
Extractors for a constant number of polynomially small min-entropy independent sources
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
Anup Rao
SAC
2006
ACM
10 years 7 months ago
Trust-decisions on the base of maximal information of recommended direct-trust
Nowadays the concept of trust in computer communications starts to get more and more popular. While the idea of trust in human interaction seems to be obvious and understandable i...
Uwe Roth, Volker Fusenig
books