3250 search results - page 269 / 650 » Parameterized Learning Complexity |
218
click to vote
JCSS
2008
15 years 6 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
229
click to vote
SIGIR
2012
ACM
13 years 8 months ago
2012
ACM
In this paper, we propose a novel top-k learning to rank framework, which involves labeling strategy, ranking model and evaluation measure. The motivation comes from the difficul...
165
click to vote
JFR
2006
15 years 6 months ago
2006
In mobile robotics, there are often features that, while potentially powerful for improving navigation, prove difficult to profit from as they generalize poorly to novel situations...
166
Voted
AAMAS
2005
Springer
15 years 6 months ago
2005
Springer
Agents in a competitive interaction can greatly benefit from adapting to a particular adversary, rather than using the same general strategy against all opponents. One method of s...
192
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
Developing effective content recognition methods for diverse imagery continues to challenge computer vision researchers. We present a new approach for document image content catego...