507 search results - page 31 / 102 » Computing Sparse Multiples of Polynomials |
JC
2000
13 years 7 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...
CW
2002
IEEE
14 years 21 days ago
2002
IEEE
For sparse array operations, in general, the sparse arrays are compressed by some data compression schemes in order to obtain better performance. The Compressed Row/Column Storage...
RECOMB
2012
Springer
11 years 10 months ago
2012
Springer
We develop a novel and general approach to estimating the accuracy of protein multiple sequence alignments without knowledge of a reference alignment, and use our approach to addre...
ICISC
2004
13 years 9 months ago
2004
We propose a new broadcast encryption scheme based on polynomial interpolations. Our scheme, obtained from the Naor-Pinkas scheme by partitioning the user set and interpolating mul...
CASC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We propose exact, complete and efficient methods for 2 problems: First, the real solving of systems of two bivariate rational polynomials of arbitrary degree. This means ...