2766 search results - page 159 / 554 » Algorithms for trigonometric polynomials |
172
click to vote
ICDT
2012
ACM
13 years 6 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
140
click to vote
CSL
2010
Springer
15 years 5 months ago
2010
Springer
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
127
click to vote
ICIP
2006
IEEE
16 years 6 months ago
2006
IEEE
Recently, it was shown that it is possible to sample classes of 1D and 2-D signals with finite rate of innovation (FRI) [9, 4, 5, 3, 2, 7]. In particular, in [7], we presented loc...
147
click to vote
PKC
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, we present the cryptanalysis of a public key scheme based on a system of multivariate polynomial equations, the ”tractable rational map” cryptosystem. We show co...
152
click to vote
COLT
2001
Springer
15 years 8 months ago
2001
Springer
We show that the class of monotone 2O( √ log n)-term DNF formulae can be PAC learned in polynomial time under the uniform distribution from random examples only. This is an expo...