Sciweavers

1763 search results - page 92 / 353
» Dependent random choice
Sort
View
CRYPTO
2001
Springer
136views Cryptology» more  CRYPTO 2001»
14 years 1 months ago
Session-Key Generation Using Human Passwords Only
We present session-key generation protocols in a model where the legitimate parties share only a human-memorizable password. The security guarantee holds with respect to probabilis...
Oded Goldreich, Yehuda Lindell
GECCO
2000
Springer
121views Optimization» more  GECCO 2000»
14 years 24 days ago
Informed operators: Speeding up genetic-algorithm-based design optimization using reduced models
In this paper we describe a method for improving genetic-algorithm-based optimization using informed genetic operators. The idea is to make the genetic operators such as mutation ...
Khaled Rasheed, Haym Hirsh
FOCS
1992
IEEE
14 years 21 days ago
Proof Verification and Hardness of Approximation Problems
The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that uses O(f(n)) random bits, queries O(g(n)) bits of ...
Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu...
MANSCI
2006
63views more  MANSCI 2006»
13 years 9 months ago
Multiplicative Background Risk
Although there has been much attention in recent years on the effects of additive background risks, the same is not true for its multiplicative counterpart. We consider random wea...
Günter Franke, Harris Schlesinger, Richard C....
IM
2007
13 years 9 months ago
Infinite Limits and Adjacency Properties of a Generalized Copying Model
We present a new model for self-organizing networks such as the web graph, and analyze its limit behaviour. In the model, new vertices are introduced over time that copy the neighb...
Anthony Bonato, Jeannette C. M. Janssen