2079 search results - page 271 / 416 » Universality of random graphs |
154
click to vote
COLT
2001
Springer
15 years 9 months ago
2001
Springer
We show that the class of monotone 2O( √ log n)-term DNF formulae can be PAC learned in polynomial time under the uniform distribution from random examples only. This is an expo...
129
click to vote
STOC
1997
ACM
15 years 8 months ago
1997
ACM
The Swendsen-Wang process provides one possible dynamics for the Qstate Potts model in statistical physics. Computer simulations of this process are widely used to estimate the ex...
129
click to vote
SOCRATES
2008
15 years 6 months ago
2008
External representations can be powerful to support learners' collaborative knowledge construction. They can focus learners on aspects which are particularly important for th...
160
click to vote
SODA
2000
ACM
15 years 6 months ago
2000
ACM
We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimat...
118
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We define a novel, basic, unsupervised learning problem learning the the lowest density homogeneous hyperplane separator of an unknown probability distribution. This task...