275 search results - page 21 / 55 » Improved Guarantees for Learning via Similarity Functions |
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
We consider the problem of maximizing welfare when allocating m items to n players with subadditive utility functions. Our main result is a way of rounding any fractional solution...
COLT
2008
Springer
14 years 11 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...
SIGMOD
2004
ACM
15 years 9 months ago
2004
ACM
Database selection is an important step when searching over large numbers of distributed text databases. The database selection task relies on statistical summaries of the databas...
SIGIR
2006
ACM
15 years 3 months ago
2006
ACM
Similarity measures for text have historically been an important tool for solving information retrieval problems. In many interesting settings, however, documents are often closel...