Sciweavers

1343 search results - page 160 / 269
» Learning to Complete Sentences
Sort
View
EUROCOLT
1999
Springer
14 years 2 months ago
Mind Change Complexity of Learning Logic Programs
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
Sanjay Jain, Arun Sharma
NIPS
1990
13 years 11 months ago
Bumptrees for Efficient Function, Constraint and Classification Learning
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
Stephen M. Omohundro
INFORMATICALT
2006
88views more  INFORMATICALT 2006»
13 years 10 months ago
Improving the Performances of Asynchronous Algorithms by Combining the Nogood Processors with the Nogood Learning Techniques
Abstract. The asynchronous techniques that exist within the programming with distributed constraints are characterized by the occurrence of the nogood values during the search for ...
Ionel Muscalagiu, Vladimir Cretu
JMLR
2002
111views more  JMLR 2002»
13 years 10 months ago
The Learning-Curve Sampling Method Applied to Model-Based Clustering
We examine the learning-curve sampling method, an approach for applying machinelearning algorithms to large data sets. The approach is based on the observation that the computatio...
Christopher Meek, Bo Thiesson, David Heckerman
SCFBM
2008
101views more  SCFBM 2008»
13 years 9 months ago
The MERG Suite: Tools for discovering competencies and associated learning resources
Background: As the demands for competency-based education grow, the need for standardsbased tools to allow for publishing and discovery of competency-based learning content is mor...
Ravi Teja Bhupatiraju, William R. Hersh, Valerie S...