2766 search results - page 256 / 554 » Algorithms for trigonometric polynomials |
138
Voted
ISSAC
2009
Springer
16 years 2 days ago
2009
Springer
An Artin-Schreier tower over the finite field Fp is a tower of field extensions generated by polynomials of the form Xp − X − α. Following Cantor and Couveignes, we give a...
139
click to vote
ICASSP
2008
IEEE
15 years 12 months ago
2008
IEEE
We present a novel classification model that is formulated as a ratio of semi-definite polynomials. We derive an efficient learning algorithm for this classifier, and apply it...
135
click to vote
QSIC
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper we propose a metric for finite processes in a probabilistic extension of CSP. The kernel of the metric corresponds to trace equivalence and most of the operators in...
146
click to vote
ISSAC
2005
Springer
15 years 11 months ago
2005
Springer
We study the multiplication of multivariate power series. We show that over large enough fields, the bilinear complexity of the product modulo a monomial ideal M is bounded by th...
141
Voted
SAT
2005
Springer
15 years 11 months ago
2005
Springer
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1−1...