713 search results - page 101 / 143 » Dispersing Hash Functions |
SPIRE
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We consider fingerprinting methods for collaborative filtering (CF) systems. In general, CF systems show their real strength when supplied with enormous data sets. Earl...
118
click to vote
PPOPP
2011
ACM
14 years 19 days ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
118
click to vote
ASIACRYPT
2011
Springer
13 years 9 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 ...
HICSS
2008
IEEE
15 years 4 months ago
2008
IEEE
Enterprise architecting is becoming critical for most modern organizations whose competitive strategies are tightly linked to the underlying information technology (IT) infrastruc...
AE
2005
Springer
15 years 3 months ago
2005
Springer
Randomization is an efficient tool for global optimization. We here define a method which keeps : – the order 0 of evolutionary algorithms (no gradient) ; – the stochastic as...