773 search results - page 45 / 155 » Traversing the Machining Graph |
ICALT
2003
IEEE
15 years 3 months ago
2003
IEEE
This paper describes a study that investigates the use of a multimodal technology in a learning task. In relation to the recent interest in learning as a multimodal experience, th...
JMLR
2010
14 years 4 months ago
2010
This paper proposes a novel algorithm for semisupervised learning. This algorithm learns graph cuts that maximize the margin with respect to the labels induced by the harmonic fun...
103
click to vote
COMBINATORICA
2010
14 years 4 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
We present a new subgoal-based method for automatically creating useful skills in reinforcement learning. Our method identifies subgoals by partitioning local state transition gra...
ECML
2006
Springer
15 years 1 months ago
2006
Springer
In many graph-based semi-supervised learning algorithms, edge weights are assumed to be fixed and determined by the data points' (often symmetric) relationships in input space...