3415 search results - page 130 / 683 » Lower bounds on kernelization |
156
click to vote
IPMU
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
189
click to vote
EUROCRYPT
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We present a new algorithm for upper bounding the maximum average linear hull probability for SPNs, a value required to determine provable security against linear cryptan...
186
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
In this paper, we show that for every constant 0 < < 1/2 and for every constant d 2, the minimum size of a depth d Boolean circuit that -approximates Majority function on n ...
148
click to vote
COLT
2007
Springer
16 years 18 days ago
2007
Springer
Recently, Balcan and Blum [1] suggested a theory of learning based on general similarity functions, instead of positive semi-definite kernels. We study the gap between the learnin...
144
click to vote
DM
2007
15 years 6 months ago
2007
Krishnamoorthy, Thulasiraman and Swamy [Minimum order graphs with specified diameter, connectivity and regularity, Networks 19 (1989) 25–46] showed that a δ-regular graph with...