2735 search results - page 232 / 547 » Comparing notions of randomness |
102
click to vote
PROVSEC
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Oracle separation methods are used in cryptography to rule out blackbox reductions between cryptographic primitives. It is sufficient to find an oracle relative to whic...
100
Voted
IJCAI
1989
15 years 1 months ago
1989
This paper considers the Valiant framework as it is applied to the task of learning logical concepts from random examples. It is argued that the current interpretation of this Val...
102
Voted
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
In the strategyproof classification setting, a set of labeled examples is partitioned among multiple agents. Given the reported labels, an optimal classification mechanism returns...
104
Voted
CRYPTO
2010
Springer
15 years 1 months ago
2010
Springer
Secure two-party authentication and key exchange are fundamental problems. Traditionally, the parties authenticate each other by means of their identities, using a public-key infr...
122
click to vote
CORR
2010
Springer
15 years 23 days ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...