Sciweavers

886 search results - page 29 / 178
» On the Autoreducibility of Random Sequences
Sort
View
AIED
2009
Springer
14 years 2 months ago
Detecting the Learning Value of Items In a Randomized Problem Set
Researchers that make tutoring systems would like to know which pieces of educational content are most effective at promoting learning among their students. Randomized controlled e...
Zachary A. Pardos, Neil T. Heffernan
ICST
2010
IEEE
13 years 6 months ago
Repairing GUI Test Suites Using a Genetic Algorithm
—Recent advances in automated functional testing of Graphical User Interfaces (GUIs) rely on deriving graph models that approximate all possible sequences of events that may be e...
Si Huang, Myra B. Cohen, Atif M. Memon
JDCTA
2010
92views more  JDCTA 2010»
13 years 2 months ago
Several Incomplete Sort Algorithms for Getting the Median Value
To quickly get the median value of any given sequence is very important in many research fields. Some popular sort algorithms are discussed in this paper. Selection sort algorithm...
Fuguo Dong
CIE
2007
Springer
14 years 1 months ago
Feasible Depth
This paper introduces two complexity-theoretic formulations of Bennett’s computational depth: finite-state depth and polynomial-time depth. It is shown that for both formulation...
David Doty, Philippe Moser
CVPR
2005
IEEE
14 years 9 months ago
Estimating Disparity and Occlusions in Stereo Video Sequences
We propose an algorithm for estimating disparity and occlusion in stereo video sequences. The algorithm defines a prior on sequences of disparity maps using a 3D Markov random fie...
Oliver M. C. Williams, Michael Isard, John MacCorm...