6251 search results - page 190 / 1251 » Randomness, Computability, and Density |
163
click to vote
ADHOCNETS
2009
Springer
15 years 10 months ago
2009
Springer
—We introduce a novel error correction scheme that uses the implicit encoding capability of Random Network Coding. This scheme does not add redundancy to the data prior to transm...
142
click to vote
HIPC
1999
Springer
15 years 8 months ago
1999
Springer
An analytical framework for modeling the performance of a single TCP session in the presence of random packet loss is presented that is based on a semi-Markov model for the window ...
125
click to vote
FOCS
2004
IEEE
15 years 7 months ago
2004
IEEE
We study a simple Markov chain, known as the Glauber dynamics, for generating a random k-coloring of a n-vertex graph with maximum degree . We prove that, for every > 0, the d...
128
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
We consider (uniform) reductions from computing a function f to the task of distinguishing the output of some pseudorandom generator G from uniform. Impagliazzo and Wigderson [IW]...
118
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We consider boolean circuits computing n-operators f : {0, 1}n {0, 1}n . As gates we allow arbitrary boolean functions; neither fanin nor fanout of gates is restricted. An operat...