716 search results - page 70 / 144 » Optimizing Sorting with Machine Learning Algorithms |
147
click to vote
COMBINATORICA
2010
14 years 9 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
117
click to vote
ICML
2010
IEEE
15 years 3 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 ...
127
click to vote
NIPS
1994
15 years 3 months ago
1994
For many types of machine learning algorithms, one can compute the statistically optimal" way to select training data. In this paper, we review how optimal data selection tec...
114
click to vote
ICML
2008
IEEE
16 years 3 months ago
2008
IEEE
Similarity matrices generated from many applications may not be positive semidefinite, and hence can't fit into the kernel machine framework. In this paper, we study the prob...
137
click to vote
ICML
2010
IEEE
15 years 3 months ago
2010
IEEE
Many applications require optimizing an unknown, noisy function that is expensive to evaluate. We formalize this task as a multiarmed bandit problem, where the payoff function is ...