2941 search results - page 294 / 589 » The Myth of the Educational Computer |
192
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of t...
162
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
191
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We propose two statistical tests to determine if two samples are from different distributions. Our test statistic is in both cases the distance between the means of the two sample...
173
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. This paper presents a novel technique for counterexample generation in probabilistic model checking of Markov chains and Markov Decision Processes. (Finite) paths in coun...
161
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...