Sciweavers

3428 search results - page 226 / 686
» Making the Case
Sort
View
FSTTCS
2010
Springer
15 years 4 months ago
Parityizing Rabin and Streett
The parity acceptance condition for -regular languages is a special case of the Rabin and Streett acceptance conditions. While the parity acceptance condition is as expressive as ...
Udi Boker, Orna Kupferman, Avital Steinitz
WAIFI
2010
Springer
158views Mathematics» more  WAIFI 2010»
15 years 4 months ago
On the Efficiency and Security of Pairing-Based Protocols in the Type 1 and Type 4 Settings
Abstract. We focus on the implementation and security aspects of cryptographic protocols that use Type 1 and Type 4 pairings. On the implementation front, we report improved timing...
Sanjit Chatterjee, Darrel Hankerson, Alfred Meneze...
ICC
2009
IEEE
135views Communications» more  ICC 2009»
15 years 4 months ago
Adaptive Compress-and-Forward Relaying in Fading Environments with or without Wyner-Ziv Coding
Abstract--Compress-and-Forward is a protocol for transmission over relay networks in which the relay forwards a compressed version of the signal it observes. The compression method...
Harold H. Sneessens, Luc Vandendorpe, J. Nicholas ...
CORR
2010
Springer
54views Education» more  CORR 2010»
15 years 3 months ago
Channel Decoding with a Bayesian Equalizer
In this paper we show that, in case of uncertainties during the estimation, overconfident posterior probabilities tend to mislead the performance of soft-decoders. Maximum likeliho...
Luis Salamanca, Juan José Murillo-Fuentes, ...
CORR
2011
Springer
155views Education» more  CORR 2011»
15 years 1 months ago
Subexponential convergence for information aggregation on regular trees
— We consider the decentralized binary hypothesis testing problem on trees of bounded degree and increasing depth. For a regular tree of depth t and branching factor k ≥ 2, we ...
Yashodhan Kanoria, Andrea Montanari