51 search results - page 3 / 11 » Space- and time-efficient polynomial multiplication |
TSP
2010
13 years 22 days ago
2010
Consider the problem of estimating the parameters of multiple polynomial phase signals observed by a sensor array. In practice, it is difficult to maintain a precisely calibrated a...
JC
2000
13 years 5 months ago
2000
We rst review thebasic properties of the well knownclasses of Toeplitz, Hankel, Vandermonde, and other related structured matrices and reexamine their correlation to operations wi...
AAAI
2007
13 years 8 months ago
2007
The multiple fault diagnosis problem is important, since the single fault assumption can lead to incorrect or failed diagnoses when multiple faults occur. It is challenging for co...
FQ
2003
Springer
13 years 11 months ago
2003
Springer
Every symplectic spread of PG(3, q), or equivalently every ovoid of Q(4, q), is shown to give a certain family of permutation polynomials of GF(q) and conversely. This leads to an...
ICDT
1995
ACM
13 years 9 months ago
1995
ACM
Following results are sketched in this extended abstract: (1) Datalog recursive programs where each rule has at most one subgoal called unit recursions are shown to be bounded, wit...