8437 search results - page 128 / 1688 » Preferences over Sets |
154
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
Given a terabyte click log, can we build an efficient and effective click model? It is commonly believed that web search click logs are a gold mine for search business, because th...
176
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
169
click to vote
ALENEX
2009
15 years 4 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
141
click to vote
WWW
2009
ACM
16 years 7 months ago
2009
ACM
In this work, a novel mobile browser for geo-referenced pictures is introduced and described. We use the term browser to denote a system aimed at browsing pictures selected from a...
184
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...