12194 search results - page 114 / 2439 » Numberings Optimal for Learning |
137
click to vote
RSS
2007
15 years 5 months ago
2007
Abstract— We consider the task of omnidirectional path following for a quadruped robot: moving a four-legged robot along any arbitrary path while turning in any arbitrary manner....
167
click to vote
SAC
2006
ACM
15 years 10 months ago
2006
ACM
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
139
click to vote
JALC
2007
15 years 4 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
161
click to vote
NIPS
2008
15 years 5 months ago
2008
The cluster assumption is exploited by most semi-supervised learning (SSL) methods. However, if the unlabeled data is merely weakly related to the target classes, it becomes quest...
132
click to vote
LWA
2007
15 years 5 months ago
2007
This paper describes the application of machine learning methods to determine parameters for DeLite, a readability checking tool. DeLite pinpoints text segments that are difficul...