876 search results - page 14 / 176 » Limits on the Usefulness of Random Oracles |
SIGMOD
2011
ACM
13 years 1 months ago
2011
ACM
Modern enterprise, web, and multimedia applications are generating unstructured content at unforeseen volumes in the form of documents, texts, and media files. Such content is gen...
COCO
2001
Springer
14 years 2 months ago
2001
Springer
This paper explores the difference between parallel and serial queries to an NP-complete oracle, SAT, from the perspective of functions with a limited number of output bits. For ...
CORR
2000
Springer
13 years 10 months ago
2000
Springer
Using Fourier analysis, we prove that the limiting distribution of the standardized random number of comparisons used by Quicksort to sort an array of n numbers has an everywhere ...
PODS
2003
ACM
14 years 10 months ago
2003
ACM
There has been increasing interest in the problem of building accurate data mining models over aggregate data, while protecting privacy at the level of individual records. One app...
EUROCOLT
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...