1401 search results - page 128 / 281 » Cost-Sensitive Test Strategies |
120
Voted
APPROX
2008
Springer
15 years 3 days ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
BCSHCI
2007
14 years 11 months ago
2007
Eye-tracking research is increasingly used to supplement usability tests in both commercial and academic practice. However, while there has been research into links between eyetra...
AAAI
1997
14 years 11 months ago
1997
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
IPM
2000
14 years 10 months ago
2000
The paper reviews the TREC Programme up to TREC-6 (1997), considering the test results, the substantive findings for IR that follow, and the lessons TREC offers for IR evaluation....
ICIP
2010
IEEE
14 years 8 months ago
2010
IEEE
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...