2299 search results - page 77 / 460 » Inference and Learning in Planning |
142
click to vote
MLG
2007
Springer
15 years 11 months ago
2007
Springer
: Network topology not only tells about tightly-connected “communities,” but also gives cues on more subtle properties of the vertices. We introduce a simple probabilistic late...
159
click to vote
ECML
2003
Springer
15 years 10 months ago
2003
Springer
Context-free grammars cannot be identified in the limit from positive examples (Gold, 1967), yet natural language grammars are more powerful than context-free grammars and humans ...
142
click to vote
COLT
1992
Springer
15 years 9 months ago
1992
Springer
This paper deals with a class of Prolog programs, called context-free term transformations (CFT). We present a polynomial time algorithm to identify a subclass of CFT, whose progr...
133
click to vote
NIPS
2003
15 years 6 months ago
2003
When we learn a new motor skill, we have to contend with both the variability inherent in our sensors and the task. The sensory uncertainty can be reduced by using information abo...
158
click to vote
CORR
2010
Springer
15 years 5 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...