Sciweavers

662 search results - page 11 / 133
» Making inferences with small numbers of training sets
Sort
View
CORR
2007
Springer
140views Education» more  CORR 2007»
13 years 7 months ago
From the entropy to the statistical structure of spike trains
— We use statistical estimates of the entropy rate of spike train data in order to make inferences about the underlying structure of the spike train itself. We first examine a n...
Yun Gao, Ioannis Kontoyiannis, Elie Bienenstock
WACV
2005
IEEE
14 years 1 months ago
Semi-Supervised Self-Training of Object Detection Models
The construction of appearance-based object detection systems is time-consuming and difficult because a large number of training examples must be collected and manually labeled i...
Chuck Rosenberg, Martial Hebert, Henry Schneiderma...
CORR
2010
Springer
253views Education» more  CORR 2010»
13 years 7 months ago
Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition
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...
Koray Kavukcuoglu, Marc'Aurelio Ranzato, Yann LeCu...
NIPS
2007
13 years 9 months ago
What makes some POMDP problems easy to approximate?
Point-based algorithms have been surprisingly successful in computing approximately optimal solutions for partially observable Markov decision processes (POMDPs) in high dimension...
David Hsu, Wee Sun Lee, Nan Rong
ML
2000
ACM
13 years 7 months ago
Maximizing Theory Accuracy Through Selective Reinterpretation
Existing methods for exploiting awed domain theories depend on the use of a su ciently large set of training examples for diagnosing and repairing aws in the theory. In this paper,...
Shlomo Argamon-Engelson, Moshe Koppel, Hillel Walt...