851 search results - page 56 / 171 » Random constructions and density results |
AUSAI
2005
Springer
15 years 4 months ago
2005
Springer
This paper considers the use of randomly generated directed graphs as neighborhoods for particle swarm optimizers (PSO) using fully informed particles (FIPS), together with dynamic...
AAAI
2008
15 years 26 days ago
2008
The surprisingly good performance of modern satisfiability (SAT) solvers is usually explained by the existence of a certain "hidden structure" in real-world instances. W...
121
click to vote
ASIACRYPT
2011
Springer
13 years 10 months ago
2011
Springer
We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into ...
PKC
2010
Springer
15 years 2 months ago
2010
Springer
Liskov proposed several weakened versions of the random oracle model, called weakened random oracle models (WROMs), to capture the vulnerability of ideal compression functions, wh...
ICML
2004
IEEE
15 years 11 months ago
2004
IEEE
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...