412 search results - page 46 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
123
click to vote
JMLR
2008
14 years 11 months ago
2008
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
118
click to vote
KDD
2012
ACM
13 years 2 months ago
2012
ACM
Historical prices are important information that can help consumers decide whether the time is right to buy a product. They provide both a context to the users, and facilitate the...
110
click to vote
COCO
2008
Springer
15 years 1 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
STOC
2003
ACM
16 years 2 days ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
120
Voted
KDD
2008
ACM
16 years 6 days ago
2008
ACM
Studying the association between quantitative phenotype (such as height or weight) and single nucleotide polymorphisms (SNPs) is an important problem in biology. To understand und...