4377 search results - page 683 / 876 » Mass problems and randomness |
157
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
159
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
We address the task of learning rankings of documents from search engine logs of user behavior. Previous work on this problem has relied on passively collected clickthrough data. ...
169
click to vote
KDD
2007
ACM
16 years 6 months ago
2007
ACM
Abstract. As more and more person-specific data like health information becomes available, increasing attention is paid to confidentiality and privacy protection. One proposed mode...
188
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
185
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
Abstract-- Sensor networks are typically unattended because of their deployment in hazardous, hostile or remote environments. This makes the problem of conserving energy at individ...