2944 search results - page 431 / 589 » Improving Bound Propagation |
132
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t...
169
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
A truthful mechanism consists of an algorithm augmented with a suitable payment function which guarantees that the "players" cannot improve their utilities by "chea...
170
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
170
click to vote
NIPS
2008
15 years 8 months ago
2008
Empirical evidence shows that in favorable situations semi-supervised learning (SSL) algorithms can capitalize on the abundance of unlabeled training data to improve the performan...
186
click to vote
COR
2010
15 years 6 months ago
2010
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...