Sciweavers

107 search results - page 17 / 22
» When Random Play is Optimal Against an Adversary
Sort
View
IACR
2011
73views more  IACR 2011»
12 years 7 months ago
Secure Authentication from a Weak Key, Without Leaking Information
We study the problem of authentication based on a weak key in the information-theoretic setting. A key is weak if its min-entropy is an arbitrary small fraction of its bit length. ...
Niek J. Bouman, Serge Fehr
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 8 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
IPPS
2002
IEEE
14 years 12 days ago
Scheduling Multiple Data Visualization Query Workloads on a Shared Memory Machine
Query scheduling plays an important role when systems are faced with limited resources and high workloads. It becomes even more relevant for servers applying multiple query optimi...
Henrique Andrade, Tahsin M. Kurç, Alan Suss...
SAB
2010
Springer
128views Optimization» more  SAB 2010»
13 years 5 months ago
Simulation of How Neuromodulation Influences Cooperative Behavior
Abstract. Neuromodulators can have a strong effect on how organisms cooperate and compete for resources. To better understand the effect of neuromodulation on cooperative behavior,...
Andrew Zaldivar, Derrik E. Asher, Jeffrey L. Krich...
AEI
1999
120views more  AEI 1999»
13 years 7 months ago
Genetic algorithms for designing multihop lightwave network topologies
Multihop lightwave networks are a means of utilizing the large bandwidth of optical fibers. In these networks, each node has a fixed number of transmitters and receivers connected...
Cenk Gazen, Cem Ersoy