Sciweavers

970 search results - page 68 / 194
» cases 2011
Sort
View
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 5 months ago
Lower bound for deterministic semantic-incremental branching programs solving GEN
We answer a problem posed in [GKM08] regarding a restricted model of small-space computation, tailored for solving the GEN problem. They define two variants of “incremental bra...
Dustin Wehr
ICASSP
2011
IEEE
13 years 1 months ago
Pilot optimization for time-delay and channel estimation in OFDM systems
Orthogonal frequency division multiplexing (OFDM) communication systems require accurate estimation of timing offset and channel impulse response in order to achieve desirable per...
Michael D. Larsen, Gonzalo Seco-Granados, A. Lee S...
ESOP
2011
Springer
13 years 1 months ago
Barriers in Concurrent Separation Logic
We develop and prove sound a concurrent separation logic for a language with Pthreads-style barriers. Although Pthreads barriers are widely used in systems, and separation logic is...
Aquinas Hobor, Cristian Gherghina
TIT
2011
120views more  TIT 2011»
13 years 4 months ago
The Secrecy Capacity Region of the Gaussian MIMO Multi-Receiver Wiretap Channel
In this paper, we consider the Gaussian multiple-input multiple-output (MIMO) multi-receiver wiretap channel in which a transmitter wants to have confidential communication with ...
Ersen Ekrem, Sennur Ulukus
IACR
2011
104views more  IACR 2011»
12 years 9 months ago
Short Transitive Signatures for Directed Trees
A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...
Philippe Camacho, Alejandro Hevia