507 search results - page 30 / 102 » Computing Sparse Multiples of Polynomials |
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
We consider the problem of clustering data lying on multiple subspaces of unknown and possibly different dimensions. We show that one can represent the subspaces with a set of pol...
NA
2010
13 years 6 months ago
2010
It is well known that it is an ill-posed problem to decide whether a function has a multiple root. Even for a univariate polynomial an arbitrary small perturbation of a polynomial ...
ICISC
2004
13 years 9 months ago
2004
We consider the generation of prime order elliptic curves (ECs) over a prime field Fp using the Complex Multiplication (CM) method. A crucial step of this method is to compute the ...
DIS
2000
Springer
14 years 2 days ago
2000
Springer
With the variety of human life, people are interested in various matters for each one’s unique reason, for which a machine maybe a better counselor than a human. This paper prop...
CIE
2010
Springer
14 years 16 days ago
2010
Springer
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...