373 search results - page 30 / 75 » Nearness and uniform convergence |
FOCS
1999
IEEE
14 years 4 days ago
1999
IEEE
We show that no Markovian Coupling argument can prove rapid mixing of the Jerrum-Sinclair Markov chain for sampling almost uniformly from the set of perfect and near perfect match...
STOC
1996
ACM
13 years 12 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
SIGCOMM
1995
ACM
13 years 11 months ago
1995
ACM
Checksum and CRC algorithms have historically been studied under the assumption that the data fed to the algorithms was uniformly distributed. This paper examines the behavior of ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
An analytical framework for performance analysis and optimization of coded V-BLAST is developed. Average power and/or rate allocations to minimize the outage probability as well as...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—In this paper, we investigate the multicast capacity for static network with heterogeneous clusters. We study the effect of heterogeneities on the achievable capacity from two a...