1389 search results - page 202 / 278 » Improved Approximation Algorithms for Label Cover Problems |
141
click to vote
AAAI
2012
13 years 5 months ago
2012
Transfer learning proves to be effective for leveraging labeled data in the source domain to build an accurate classifier in the target domain. The basic assumption behind transf...
117
click to vote
IROS
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract— In their interactions with the world robots inevitably face equivalent action choices, situations in which multiple actions are equivalently applicable. In this paper, ...
153
click to vote
ATAL
2011
Springer
14 years 2 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
111
click to vote
ECML
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Active learning algorithms attempt to accelerate the learning process by requesting labels for the most informative items first. In real-world problems, however, there ma...
177
click to vote
ICPR
2010
IEEE
15 years 9 months ago
2010
IEEE
Many vision applications have been formulated as Markov Random Field (MRF) problems. Although many of them are discrete labeling problems, continuous formulation often achieves gre...