1253 search results - page 73 / 251 » Exploration Testing |
102
click to vote
SIGIR
2010
ACM
15 years 28 days ago
2010
ACM
The TREC Blog track aims to explore information seeking behaviour in the blogosphere, by building reusable test collections for blog-related search tasks. Since, its advent in TRE...
117
click to vote
WEA
2005
Springer
15 years 8 months ago
2005
Springer
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...
162
Voted
IGARSS
2009
15 years 8 days ago
2009
We have explored in this paper a framework to test in a quantitative manner the stability of different endmember extraction and spectral unmixing algorithms based on the concept o...
150
click to vote
ERCIMDL
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. This paper presents an approach to automatically subject index fulltext documents with multiple labels based on binary support vector machines (SVM). The aim was to test ...
121
click to vote
COGSR
2011
14 years 9 months ago
2011
In bandit problems, a decision-maker must choose between a set of alternatives, each of which has a fixed but unknown rate of reward, to maximize their total number of rewards ov...