4903 search results - page 275 / 981 » The Set Covering Machine |
177
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
We introduce an efficient algorithm for the problem of online linear optimization in the bandit setting which achieves the optimal O ( T) regret. The setting is a natural general...
151
click to vote
ECTEL
2008
Springer
15 years 8 months ago
2008
Springer
This paper presents a quantitative analysis of the reuse of learning objects in real world settings. The data for this analysis was obtained from three sources: Connexions' mo...
200
click to vote
EMNLP
2004
15 years 8 months ago
2004
In this paper we investigate whether paragraphs can be identified automatically in different languages and domains. We propose a machine learning approach which exploits textual a...
164
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We introduce new, efficient algorithms for value iteration with multiple reward functions and continuous state. We also give an algorithm for finding the set of all nondominated a...
165
click to vote
ML
2006
ACM
15 years 6 months ago
2006
ACM
Clustering is the problem of identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity classes. This p...