2412 search results - page 68 / 483 » Which Problems Have Strongly Exponential Complexity |
116
click to vote
SIAMJO
2011
14 years 7 months ago
2011
Abstract. The condition number of a Gram matrix defined by a polynomial basis and a set of points is often used to measure the sensitivity of the least squares polynomial approxim...
98
Voted
FOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
We introduce a new primitive called Intrusion-Resilient Secret Sharing (IRSS), whose security proof exploits the fact that there exist functions which can be efficiently computed ...
128
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
104
Voted
WWW
2005
ACM
16 years 1 months ago
2005
ACM
By far, the support vector machines (SVM) achieve the state-of-theart performance for the text classification (TC) tasks. Due to the complexity of the TC problems, it becomes a ch...
152
click to vote
STOC
2000
ACM
15 years 5 months ago
2000
ACM
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...