111 search results - page 6 / 23 » Randomized computations on large data sets: tight lower boun... |
166
click to vote
COLT
2005
Springer
15 years 11 months ago
2005
Springer
We present two new methods for obtaining generalization error bounds in a semi-supervised setting. Both methods are based on approximating the disagreement probability of pairs of ...
160
click to vote
FOCS
2006
IEEE
15 years 11 months ago
2006
IEEE
A family of subsets C of [n] def = {1, . . . , n} is (r, t)exclusive if for every S ⊂ [n] of size at least n − r, there exist S1, . . . , St ∈ C with S = S1∪S2∪· · · ...
166
click to vote
JCO
2008
15 years 5 months ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
127
click to vote
CRYPTO
2005
Springer
15 years 11 months ago
2005
Springer
We investigate methods for providing easy-to-check proofs of computational effort. Originally intended for discouraging spam, the concept has wide applicability as a method for co...
153
click to vote
ISTCS
1993
Springer
15 years 9 months ago
1993
Springer
This thesis introduces a model of a random walk on a colored undirected graph. Such a graph has a single vertex set and distinct sets of edges, each of which has a color. A par...