51692 search results - page 10287 / 10339 » it 2008 |
SIGECOM
2008
ACM
13 years 9 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
SIGIR
2008
ACM
13 years 9 months ago
2008
ACM
Search personalization has been pursued in many ways, in order to provide better result rankings and better overall search experience to individual users [5]. However, blindly app...
SIGIR
2008
ACM
13 years 9 months ago
2008
ACM
Address geocoding, the process of finding the map location for a structured postal address, is a relatively well-studied problem. In this paper we consider the more general proble...
SIGIR
2008
ACM
13 years 9 months ago
2008
ACM
Motivated by our work with political scientists who need to manually analyze large Web archives of news sites, we present SpotSigs, a new algorithm for extracting and matching sig...
SIGIR
2008
ACM
13 years 9 months ago
2008
ACM
One of the central issues in learning to rank for information retrieval is to develop algorithms that construct ranking models by directly optimizing evaluation measures used in i...