495 search results - page 67 / 99 » Approximation algorithms for budgeted learning problems |
96
Voted
KDD
2010
ACM
15 years 1 months ago
2010
ACM
In multi-label learning, each training example is associated with a set of labels and the task is to predict the proper label set for the unseen example. Due to the tremendous (ex...
83
Voted
ECCV
2002
Springer
15 years 11 months ago
2002
Springer
We present a novel method for inferring three-dimensional shape from a collection of defocused images. It is based on the observation that defocused images are the null-space of ce...
ESANN
2003
14 years 11 months ago
2003
The resource constraint project scheduling problem (RCPSP) is an NP-hard benchmark problem in scheduling which takes into account the limitation of resources’ availabilities in ...
106
click to vote
CORR
2006
Springer
14 years 9 months ago
2006
Springer
While in general trading off exploration and exploitation in reinforcement learning is hard, under some formulations relatively simple solutions exist. Optimal decision thresholds ...
96
Voted
COLING
1996
14 years 11 months ago
1996
We address the problem of automatically acquiring case frame patterns (selectional patterns) from large corpus data. In particular, we l)ropose a method of learning dependencies b...