316 search results - page 4 / 64 » On the Space Complexity of Randomized Synchronization |
TIT
2010
13 years 2 months ago
2010
Spectral efficiency for asynchronous code division multiple access (CDMA) with random spreading is calculated in the large system limit. We allow for arbitrary chip waveforms and ...
TIT
2008
13 years 7 months ago
2008
This paper presents a quasi-random approach to space-time (ST) codes. The basic principle is conceptually simple, yet still very effective and flexible regarding the transmission ...
INFOCOM
2003
IEEE
14 years 20 days ago
2003
IEEE
Abstract— The aim of this paper is to analyze the performance of a large number of long lived TCP controlled flows sharing many routers (or links), from the knowledge of the net...
NAACL
2007
13 years 8 months ago
2007
We relate the problem of finding the best application of a Synchronous ContextFree Grammar (SCFG) rule during parsing to a Markov Random Field. This representation allows us to u...
EUROCRYPT
2010
Springer
13 years 10 months ago
2010
Springer
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior construction...