Sciweavers

492 search results - page 36 / 99
» The number of possibilities for random dating
Sort
View
JOC
2011
104views more  JOC 2011»
12 years 11 months ago
Short Undeniable Signatures Based on Group Homomorphisms
This paper is devoted to the design and analysis of short undeniable signatures based on a random oracle. Exploiting their online property, we can achieve signatures with a fully s...
Jean Monnerat, Serge Vaudenay
TIT
2002
63views more  TIT 2002»
13 years 8 months ago
Structured unitary space-time autocoding constellations
We recently showed that arbitrarily reliable communication is possible within a single coherence interval in Rayleigh flat fading as the symbol-duration of the coherence interval ...
Thomas L. Marzetta, Babak Hassibi, Bertrand M. Hoc...
INDOCRYPT
2004
Springer
14 years 2 months ago
Information Theory and the Security of Binary Data Perturbation
Random data perturbation (RDP) has been in use for several years in statistical databases and public surveys as a means of providing privacy to individuals while collecting informa...
Poorvi L. Vora
NIPS
2008
13 years 10 months ago
Algorithms for Infinitely Many-Armed Bandits
We consider multi-armed bandit problems where the number of arms is larger than the possible number of experiments. We make a stochastic assumption on the mean-reward of a new sel...
Yizao Wang, Jean-Yves Audibert, Rémi Munos
VLDB
2002
ACM
108views Database» more  VLDB 2002»
13 years 8 months ago
Adaptive Index Structures
Traditional indexes aim at optimizing the node accesses during query processing, which, however, does not necessarily minimize the total cost due to the possibly large number of r...
Yufei Tao, Dimitris Papadias