3415 search results - page 266 / 683 » Lower bounds on kernelization |
163
click to vote
ACSAC
2006
IEEE
16 years 23 days ago
2006
IEEE
We propose an architecture of four complimentary technologies increasingly relevant to a growing number of home users and organizations: cryptography, separation kernels, formal v...
171
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
When equipped with kernel functions, online learning algorithms are susceptible to the "curse of kernelization" that causes unbounded growth in the model size. To addres...
189
click to vote
STOC
2007
ACM
16 years 7 months 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...
169
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
202
Voted
CRYPTO
2001
Springer
15 years 11 months ago
2001
Springer
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...