Sciweavers

2434 search results - page 418 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
100
Voted
COLT
2008
Springer
15 years 2 months ago
Adapting to a Changing Environment: the Brownian Restless Bandits
In the multi-armed bandit (MAB) problem there are k distributions associated with the rewards of playing each of k strategies (slot machine arms). The reward distributions are ini...
Aleksandrs Slivkins, Eli Upfal
88
Voted
BMCBI
2008
144views more  BMCBI 2008»
15 years 19 days ago
Pep-3D-Search: a method for B-cell epitope prediction based on mimotope analysis
Background: The prediction of conformational B-cell epitopes is one of the most important goals in immunoinformatics. The solution to this problem, even if approximate, would help...
Yanxin Huang, Yongli Bao, Shu Yan Guo, Yan Wang, C...
106
Voted
SIGIR
2002
ACM
15 years 5 days ago
Document clustering with cluster refinement and model selection capabilities
In this paper, we propose a document clustering method that strives to achieve: (1) a high accuracy of document clustering, and (2) the capability of estimating the number of clus...
Xin Liu, Yihong Gong, Wei Xu, Shenghuo Zhu
114
Voted
DAC
2006
ACM
16 years 1 months ago
Power-centric design of high-speed I/Os
With increasing aggregate off-chip bandwidths exceeding terabits/second (Tb/s), the power dissipation is a serious design consideration. Additionally, design of I/O links is const...
Hamid Hatamkhani, Frank Lambrecht, Vladimir Stojan...
KDD
2007
ACM
192views Data Mining» more  KDD 2007»
16 years 28 days ago
Active exploration for learning rankings from clickthrough data
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. ...
Filip Radlinski, Thorsten Joachims