6251 search results - page 90 / 1251 » Randomness, Computability, and Density |
SIGECOM
2006
ACM
14 years 3 months ago
2006
ACM
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
LREC
2010
13 years 11 months ago
2010
Determining semantic relatedness between words or concepts is a fundamental process to many Natural Language Processing applications. Approaches for this task typically make use o...
FOCS
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
TMC
2011
13 years 4 months ago
2011
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
CRYPTO
2004
Springer
14 years 3 months ago
2004
Springer
Unconditionally secure multi-party computations in general, and broadcast in particular, are impossible if any third of the players can be actively corrupted and if no additional i...