470 search results - page 5 / 94 » A new family of online algorithms for category ranking |
ECIR
2011
Springer
12 years 9 months ago
2011
Springer
Abstract. As retrieval systems become more complex, learning to rank approaches are being developed to automatically tune their parameters. Using online learning to rank approaches...
APPROX
2011
Springer
12 years 6 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
WWW
2010
ACM
14 years 1 months ago
2010
ACM
With the explosive growth of digital cameras and online media, it has become crucial to design efficient methods that help users browse and search large image collections. The rec...
WWW
2003
ACM
14 years 7 months ago
2003
ACM
This paper describes a new paradigm for modeling traffic levels on the world wide web (WWW) using a method of entropy maximization. This traffic is subject to the conservation con...
COLT
2001
Springer
13 years 10 months ago
2001
Springer
In this paper we study a paradigm to generalize online classification algorithms for binary classification problems to multiclass problems. The particular hypotheses we investig...