5785 search results - page 192 / 1157 » Approximability of Probability Distributions |
153
click to vote
SODA
2001
ACM
15 years 5 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
131
Voted
APPROX
2005
Springer
15 years 9 months ago
2005
Springer
Abstract: We study the average-case learnability of DNF formulas in the model of learning from uniformly distributed random examples. We define a natural model of random monotone ...
140
Voted
ASIACRYPT
2006
Springer
15 years 7 months ago
2006
Springer
We consider the problem of cheating in secret sharing schemes, cheating in which individuals submit forged shares in the secret reconstruction phase in an effort to make another pa...
118
Voted
WSC
2007
15 years 6 months ago
2007
We consider the problem of efficient estimation of first passage time probabilities for a multidimensional random walk with t distributed increments, via simulation. In addition...
129
click to vote
BCS
2008
15 years 5 months ago
2008
In recent years, Denial of Service attacks have evolved into a predominant network security threat. In our previous work, we identified the necessary building blocks for an effect...