590 search results - page 21 / 118 » Can We Learn to Beat the Best Stock |
108
click to vote
DEBS
2010
ACM
15 years 1 months ago
2010
ACM
We present a case study parallelizing streaming aggregation on three different parallel hardware architectures. Aggregation is a performance-critical operation for data summarizat...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
We study online learning in an oblivious changing environment. The standard measure of regret bounds the difference between the cost of the online learner and the best decision in...
AAAI
2006
14 years 11 months ago
2006
When humans approach the task of text categorization, they interpret the specific wording of the document in the much larger context of their background knowledge and experience. ...
ALT
2006
Springer
15 years 6 months ago
2006
Springer
Most of the existing active learning algorithms are based on the realizability assumption: The learner’s hypothesis class is assumed to contain a target function that perfectly c...
COLT
2001
Springer
15 years 2 months ago
2001
Springer
We show that the class of monotone 2O( √ log n)-term DNF formulae can be PAC learned in polynomial time under the uniform distribution from random examples only. This is an expo...