1473 search results - page 16 / 295 » Permutation Tests for Classification |
75
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We construct a financial "Turing test" to determine whether human subjects can differentiate between actual vs. randomized financial returns. The experiment consists of ...
105
Voted
STOC
2004
ACM
15 years 10 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
FLAIRS
2004
14 years 11 months ago
2004
This paper presents work that uses Transductive Latent Semantic Indexing (LSI) for text classification. In addition to relying on labeled training data, we improve classification ...
NAA
2000
Springer
15 years 1 months ago
2000
Springer
We describe the implementation and performance of a novel fill-minimization ordering technique for sparse LU factorization with partial pivoting. The technique was proposed by Gilb...
DAGSTUHL
2006
14 years 11 months ago
2006
We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypothesis testing in a framework of classical mathe...