Transductive Rademacher complexities for learning over a graph thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Transductive Rademacher complexities for learning over a graph

Published on Sep 07, 20074506 Views

Recent investigations indicate the use of a probabilistic ”learning” perspective of tasks defined on a single graph, as opposed to the traditional algorithmical ”computational” point of view. This

Related categories