1389 search results - page 222 / 278 » Improved Approximation Algorithms for Label Cover Problems |
ECML
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We investigate the problem of using function approximation in reinforcement learning where the agent’s policy is represented as a classifier mapping states to actions....
118
click to vote
SIGIR
2012
ACM
13 years 12 days ago
2012
ACM
Combating Web spam is one of the greatest challenges for Web search engines. State-of-the-art anti-spam techniques focus mainly on detecting varieties of spam strategies, such as ...
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
DAS
2006
Springer
15 years 1 months ago
2006
Springer
Traditional approaches to combining classifiers attempt to improve classification accuracy at the cost of increased processing. They may be viewed as providing an accuracy-speed tr...
ECCV
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...