1658 search results - page 83 / 332 » Learning Unknown Graphs |
234
click to vote
MLQ
2011
14 years 11 months ago
2011
Given a graph G whose set of vertices is a Polish space X, the weak Borel chromatic number of G is the least size of a family of pairwise disjoint G-independent Borel sets that cov...
144
click to vote
ICTAI
2009
IEEE
15 years 11 months ago
2009
IEEE
In this paper a learning based local search approach for propositional satisfiability is presented. It is based on an original adaptation of the conflict driven clause learning ...
158
click to vote
PKDD
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Gaussian processes have successfully been used to learn preferences among entities as they provide nonparametric Bayesian approaches for model selection and probabilistic...
132
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Graph based semi-supervised learning methods (SSL) implicitly assume that the intrinsic geometry of the data points can be fully specified by an Euclidean distance based local ne...
136
click to vote
ITS
2000
Springer
15 years 8 months ago
2000
Springer
We developed a distributed support model in an interface for distant learning. The support is integrated into the ExploraGraph navigator which makes it possible to navigate through...