Sciweavers

806 search results - page 82 / 162
» Lower Bounds on Correction Networks
Sort
View
INFOCOM
2003
IEEE
15 years 11 months ago
An information theoretic view of network management
—We present an information-theoretic framework for network management for recovery from nonergodic link failures. Building on recent work in the field of network coding, we desc...
Tracey Ho, Muriel Médard, Ralf Koetter
ASIACRYPT
2008
Springer
15 years 8 months ago
Chosen Ciphertext Security with Optimal Ciphertext Overhead
Every public-key encryption scheme has to incorporate a certain amount of randomness into its ciphertexts to provide semantic security against chosen ciphertext attacks (IND-CCA). ...
Masayuki Abe, Eike Kiltz, Tatsuaki Okamoto
BDA
2003
15 years 7 months ago
Memory Requirements for Query Execution in Highly Constrained Devices
Pervasive computing introduces data management requirements that must be tackled in a growingvariety of lightweight computing devices. Personal folders on chip, networks of sensor...
Nicolas Anciaux, Luc Bouganim, Philippe Pucheral
MOR
2006
80views more  MOR 2006»
15 years 6 months ago
Regret Minimization Under Partial Monitoring
We consider repeated games in which the player, instead of observing the action chosen by the opponent in each game round, receives a feedback generated by the combined choice of ...
Nicolò Cesa-Bianchi, Gábor Lugosi, G...
TSP
2010
15 years 21 days ago
Optimal/near-optimal dimensionality reduction for distributed estimation in homogeneous and certain inhomogeneous scenarios
We consider distributed estimation of a deterministic vector parameter from noisy sensor observations in a wireless sensor network (WSN). The observation noise is assumed uncorrela...
Jun Fang, Hongbin Li