4377 search results - page 824 / 876 » Mass problems and randomness |
178
click to vote
TCC
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
166
Voted
PKC
2009
Springer
16 years 6 months ago
2009
Springer
Similar to verifiable shuffling (or, mixing), we consider the problem of verifiable rotating (and random re-encrypting) a given list of homomorphic encryptions. The offset by which...
190
click to vote
KDD
2009
ACM
16 years 6 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
170
click to vote
PERCOM
2009
ACM
16 years 6 months ago
2009
ACM
In this paper, a DHT-based routing protocol which integrates at the network layer both traditional direct routing, i.e. MANET routing, and indirect key-based routing, i.e. P2P rout...
145
click to vote
MOBIHOC
2009
ACM
16 years 6 months ago
2009
ACM
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...