2766 search results - page 221 / 554 » Algorithms for trigonometric polynomials |
130
click to vote
COLT
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...
151
click to vote
IFIP
2004
Springer
15 years 10 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
296
click to vote
IACR
2011
14 years 4 months ago
2011
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
158
click to vote
ICIP
2006
IEEE
16 years 7 months ago
2006
IEEE
Recently, new sampling schemes were presented for signals with finite rate of innovation (FRI) using sampling kernels reproducing polynomials or exponentials [1] [2]. In this pape...
235
click to vote
CVPR
1999
IEEE
16 years 6 months ago
1999
IEEE
An algebraic curve is defined as the zero set of a polynomial in two variables. Algebraic curves are practical for modeling shapes much more complicated than conics or su...