Sciweavers

876 search results - page 51 / 176
» Limits on the Usefulness of Random Oracles
Sort
View
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 22 days ago
Tight Bounds on the Capacity of Binary Input random CDMA Systems
Abstract-- We consider code division multiple access communication over a binary input additive white Gaussian noise channel using random spreading. For a general class of symmetri...
Satish Babu Korada, Nicolas Macris
91
Voted
CORR
2008
Springer
141views Education» more  CORR 2008»
15 years 22 days ago
Distributed Source Coding using Abelian Group Codes
In this work, we consider a distributed source coding problem with a joint distortion criterion depending on the sources and the reconstruction. This includes as a special case the...
Dinesh Krithivasan, S. Sandeep Pradhan
99
Voted
EUROPAR
2005
Springer
15 years 6 months ago
New Bounds on the Competitiveness of Randomized Online Call Control in Cellular Networks
Abstract. We address the call control problem in wireless cellular networks that utilize Frequency Division Multiplexing (FDM) technology. In such networks, many users within the s...
Ioannis Caragiannis, Christos Kaklamanis, Evi Papa...
ALT
2006
Springer
15 years 9 months ago
Iterative Learning from Positive Data and Negative Counterexamples
A model for learning in the limit is defined where a (so-called iterative) learner gets all positive examples from the target language, tests every new conjecture with a teacher ...
Sanjay Jain, Efim B. Kinber
107
Voted
IWSEC
2009
Springer
15 years 7 months ago
ID-Based Group Password-Authenticated Key Exchange
Abstract—Password-authenticated key exchange (PAKE) protocols are designed to be secure even when the secret key used for authentication is a human-memorable password. In this pa...
Xun Yi, Raylin Tso, Eiji Okamoto