5954 search results - page 613 / 1191 » Querying Bi-level Information |
249
click to vote
COLT
2010
Springer
15 years 5 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
246
click to vote
PODS
2011
ACM
14 years 10 months ago
2011
ACM
In the traditional data exchange setting, source instances are restricted to be complete in the sense that every fact is either true or false in these instances. Although natural ...
180
click to vote
WWW
2004
ACM
16 years 8 months ago
2004
ACM
Current search technologies work in "one size fits all" fashion. Therefore, the answer to a query is independent of specific user information need. In this paper, we des...
201
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Long-term search history contains rich information about a user's search preferences. In this paper, we study statistical language modeling based methods to mine contextual i...
192
click to vote
EDBT
2009
ACM
16 years 2 months ago
2009
ACM
Given the proliferation of technology sites and the growing diversity of their readership, readers are more and more likely to encounter specialized language and terminology that ...