1169 search results - page 103 / 234 » Task-aware search personalization |
ACMICEC
2007
ACM
14 years 2 months ago
2007
ACM
We investigate asymptotically optimal keyword auctions, that is, auctions which maximize revenue as the number of bidders grows. We do so under two alternative behavioral assumpti...
CCS
2010
ACM
13 years 10 months ago
2010
ACM
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...
SIGMOD
2010
ACM
13 years 10 months ago
2010
ACM
An increasing number of applications operate on data obtained from the Web. These applications typically maintain local copies of the web data to avoid network latency in data acc...
WWW
2006
ACM
14 years 11 months ago
2006
ACM
We introduce a new, powerful class of text proximity queries: find an instance of a given "answer type" (person, place, distance) near "selector" tokens matchi...
KDD
2008
ACM
14 years 10 months ago
2008
ACM
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...