2434 search results - page 451 / 487 » Algorithmic Randomness of Closed Sets |
103
Voted
ML
1998
ACM
15 years 2 days ago
1998
ACM
It is well known that prior knowledge or bias can speed up learning, at least in theory. It has proved di cult to make constructive use of prior knowledge, so that approximately c...
118
Voted
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
Graph transduction methods label input data by learning a classification function that is regularized to exhibit smoothness along a graph over labeled and unlabeled samples. In pr...
WWW
2007
ACM
16 years 1 months ago
2007
ACM
Several research efforts as well as deployments have chosen IEEE 802.11 as a low-cost, long-distance access technology to bridge the digital divide. In this paper, we consider the...
90
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
112
Voted
STOC
2007
ACM
16 years 22 days ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...