251 search results - page 36 / 51 » On Modular Decomposition of Integers |
PKC
2004
Springer
15 years 3 months ago
2004
Springer
Let E be an elliptic curve defined over F2n . The inverse operation of point doubling, called point halving, can be done up to three times as fast as doubling. Some authors have t...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials...
104
click to vote
CGF
1998
14 years 9 months ago
1998
A multiresolution data decomposition offers a fundamental framework supporting compression, progressive transmission, and level-of-detail (LOD) control for large two or three dime...
CSCWD
2009
Springer
15 years 4 months ago
2009
Springer
This work presents a methodology to formally model and to build collaborative three dimensional interaction tasks in virtual environments using three different tools: Petri Nets, ...
ISSAC
2009
Springer
15 years 4 months ago
2009
Springer
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new...