2252 search results - page 318 / 451 » Improving Random Forests |
WWW
2008
ACM
14 years 11 months ago
2008
ACM
We consider the budget-constrained bidding optimization problem for sponsored search auctions, and model it as an online (multiple-choice) knapsack problem. We design both determi...
WWW
2003
ACM
14 years 11 months ago
2003
ACM
The presence of replicas or near-replicas of documents is very common on the Web. Documents may be replicated completely or partially for different reasons (versions, mirrors, etc...
MOBIHOC
2009
ACM
14 years 11 months ago
2009
ACM
In this paper, we propose a practical scheme, called Non-Binary Joint Network-Channel Decoding (NB-JNCD) for reliable communication in wireless networks. It seamlessly couples cha...
KDD
2007
ACM
14 years 11 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. ...
KDD
2007
ACM
14 years 11 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...