We investigate the question of whether one can characterize complexity classes (such as PSPACE or NEXP) in terms of efficient reducibility to the set of Kolmogorovrandom strings R...
Often efforts to change techniques or processes are met by "But its working, why change now?" Usually the impetous for change comes from someone who does not believe it ...
—We address the problem of determining what size test set guarantees statistically significant results in a character recognition task, as a function of the expected error rate. ...
Isabelle Guyon, John Makhoul, Richard M. Schwartz,...
The traditional, well established approach to finding out what works in education research is to run a randomized controlled trial (RCT) using a standard pretest and posttest desig...
Zachary A. Pardos, Matthew D. Dailey, Neil T. Heff...
CHI Participants are increasingly creating work in multiple formats and media. Much of this work is well suited to the kind of efficient and effective graphic and text presentatio...