1068 search results - page 93 / 214 » Factorization as a Rank 1 Problem |
AAAI
2010
14 years 11 months ago
2010
In many auctions, agents bid more aggressively than selfinterest would prescribe. This can be explained by spite, where the agent's utility not only increases in the agent�...
ESA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
JGT
2007
14 years 9 months ago
2007
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...
CIKM
2001
Springer
15 years 2 months ago
2001
Springer
Given the ranked lists of documents returned by multiple search engines in response to a given query, the problem of metasearch is to combine these lists in a way which optimizes ...