886 search results - page 29 / 178 » On the Autoreducibility of Random Sequences |
170
click to vote
AIED
2009
Springer
16 years 5 days ago
2009
Springer
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...
183
click to vote
ICST
2010
IEEE
15 years 4 months ago
2010
IEEE
—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...
159
Voted
JDCTA
2010
15 years 11 days ago
2010
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...
132
Voted
CIE
2007
Springer
15 years 11 months ago
2007
Springer
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...
177
click to vote
CVPR
2005
IEEE
16 years 7 months ago
2005
IEEE
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...