103 search results - page 21 / 21 » The Arithmetical Complexity of Dimension and Randomness |
INFOCOM
2006
IEEE
13 years 11 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
ASIACRYPT
2010
Springer
13 years 3 months ago
2010
Springer
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
TALG
2010
13 years 2 hour ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...