Sciweavers

1837 search results - page 97 / 368
» Learning From Ambiguous Examples
Sort
View
143
Voted
ALT
1998
Springer
15 years 9 months ago
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
Valery N. Shevchenko, Nikolai Yu. Zolotykh
272
Voted
FM
1997
Springer
258views Formal Methods» more  FM 1997»
15 years 9 months ago
Consistent Graphical Specification of Distributed Systems
: The widely accepted possible benefits of formal methods on the one hand and their minor use compared to informal or graphical description techniques on the other hand have repeat...
Franz Huber, Bernhard Schätz, Geralf Einert
NIPS
1994
15 years 6 months ago
On-line Learning of Dichotomies
The performance of on-line algorithms for learning dichotomies is studied. In on-line learning, the number of examples P is equivalent to the learning time, since each example is ...
N. Barkai, H. Sebastian Seung, Haim Sompolinsky
AROBOTS
2002
115views more  AROBOTS 2002»
15 years 4 months ago
Statistical Learning for Humanoid Robots
The complexity of the kinematic and dynamic structure of humanoid robots make conventional analytical approaches to control increasingly unsuitable for such systems. Learning techn...
Sethu Vijayakumar, Aaron D'Souza, Tomohiro Shibata...
ALT
2005
Springer
16 years 1 months ago
Non U-Shaped Vacillatory and Team Learning
U-shaped learning behaviour in cognitive development involves learning, unlearning and relearning. It occurs, for example, in learning irregular verbs. The prior cognitive science...
Lorenzo Carlucci, John Case, Sanjay Jain, Frank St...