1658 search results - page 103 / 332 » Learning Unknown Graphs |
139
Voted
ESANN
2007
15 years 6 months ago
2007
Local algorithms for non-linear dimensionality reduction [1], [2], [3], [4], [5] and semi-supervised learning algorithms [6], [7] use spectral decomposition based on a nearest neig...
117
click to vote
COLT
2006
Springer
15 years 8 months ago
2006
Springer
Bounds are given for the empirical and expected Rademacher complexity of classes of linear transformations from a Hilbert space H to a ...nite dimensional space. The results imply ...
123
click to vote
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
144
click to vote
ICCS
1993
Springer
15 years 8 months ago
1993
Springer
Adaptive predictive search (APS), is a learning system framework, which given little initial domain knowledge, increases its decision-making abilities in complex problems domains....
150
click to vote
SIROCCO
2007
15 years 6 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...