Sciweavers

721 search results - page 47 / 145
» On Generators of Random Quasigroup Problems
Sort
View
FOCS
2002
IEEE
14 years 29 days ago
On the (non)Universality of the One-Time Pad
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
Yevgeniy Dodis, Joel Spencer
DAC
2006
ACM
14 years 9 months ago
Scheduling-based test-case generation for verification of multimedia SoCs
Multimedia SoCs are characterized by a main controller that directs the activity of several cores, each of which is in charge of a stage in the processing of a media stream. The v...
Amir Nahir, Avi Ziv, Roy Emek, Tal Keidar, Nir Ron...
NTMS
2009
IEEE
14 years 2 months ago
An Adaptive Quantization Algorithm for Secret Key Generation Using Radio Channel Measurements
—New approaches that generate secret keys from radio channel characteristics have been recently proposed. The security of these schemes usually relies on the reciprocity principl...
Sana Tmar Ben Hamida, Jean-Benoît Pierrot, C...
CORR
2012
Springer
235views Education» more  CORR 2012»
12 years 3 months ago
An Incremental Sampling-based Algorithm for Stochastic Optimal Control
Abstract— In this paper, we consider a class of continuoustime, continuous-space stochastic optimal control problems. Building upon recent advances in Markov chain approximation ...
Vu Anh Huynh, Sertac Karaman, Emilio Frazzoli
WEA
2010
Springer
284views Algorithms» more  WEA 2010»
14 years 2 months ago
Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002