16188 search results - page 6 / 3238 » The Optimal PAC Algorithm |
ICDE
2000
IEEE
14 years 8 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...
STOC
2006
ACM
14 years 7 months ago
2006
ACM
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
NIPS
2001
13 years 8 months ago
2001
The rule-based bootstrapping introduced by Yarowsky, and its cotraining variant by Blum and Mitchell, have met with considerable empirical success. Earlier work on the theory of c...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We consider the general, widely applicable problem of selecting from n real-valued random variables a subset of size m of those with the highest means, based on as few samples as ...