Sciweavers

1510 search results - page 78 / 302
» Upper Probabilities and Additivity
Sort
View
TIT
2011
119views more  TIT 2011»
14 years 4 months ago
Redundancy-Related Bounds for Generalized Huffman Codes
— This paper presents new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to various nonlinear codeword length...
Michael B. Baer
TSP
2010
14 years 4 months ago
Optimal linear fusion for distributed detection via semidefinite programming
Consider the problem of signal detection via multiple distributed noisy sensors. We propose a linear decision fusion rule to combine the local statistics from individual sensors i...
Zhi Quan, Wing-Kin Ma, Shuguang Cui, Ali H. Sayed
CRYPTO
2007
Springer
106views Cryptology» more  CRYPTO 2007»
15 years 1 months ago
Indistinguishability Amplification
system is the abstraction of the input-output behavior of any kind of discrete system, in particular cryptographic systems. Many aspects of cryptographic security analyses and pro...
Ueli M. Maurer, Krzysztof Pietrzak, Renato Renner
NECO
2006
98views more  NECO 2006»
14 years 9 months ago
Comment on "Characterization of Subthreshold Voltage Fluctuations in Neuronal Membranes, " by M. Rudolph and A. Destexhe
In two recent papers, Rudolph and Destexhe (Neural Comp. 15, 2577-2618, 2003; Neural Comp. in press, 2005) studied a leaky integrator model (i.e. an RC-circuit) driven by correlat...
Benjamin Lindner, André Longtin
MFCS
2007
Springer
15 years 4 months ago
Communication in Networks with Random Dependent Faults
The aim of this paper is to study communication in networks where nodes fail in a random dependent way. In order to capture fault dependencies, we introduce the neighborhood fault...
Evangelos Kranakis, Michel Paquette, Andrzej Pelc