1089 search results - page 21 / 218 » Bounds on generalized Frobenius numbers |
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
We study a class of algorithms that speed up the training process of support vector machines (SVMs) by returning an approximate SVM. We focus on algorithms that reduce the size of...
EUROCRYPT
2012
Springer
11 years 10 months ago
2012
Springer
We show that homomorphic evaluation of (wide enough) arithmetic circuits can be accomplished with only polylogarithmic overhead. Namely, we present a construction of fully homomorp...
EUROCRYPT
1999
Springer
13 years 12 months ago
1999
Springer
We prove the first general and non-trivial lower bound for the number of times a 1-out-of-n Oblivious Transfer of strings of length should be invoked so as to obtain, by an inform...
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
Accurately and efficiently estimating the number of distinct values for some attribute(s) or sets of attributes in a data set is of critical importance to many database operation...