1291 search results - page 9 / 259 » Computing the multiplicity structure in solving polynomial s... |
IJNSEC
2010
13 years 2 months ago
2010
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
ICPPW
2007
IEEE
14 years 1 months ago
2007
IEEE
We study the role of task-level scheduling in power management on multicore multiple voltage embedded systems. Multicore on-achip, in particular DSP systems, can greatly improve p...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
—The article describes a course on system design (structural approach) which involves the following: issues of systems engineering; structural models; basic technological problem...
SIBGRAPI
2006
IEEE
14 years 1 months ago
2006
IEEE
The estimation of multiple orientations in multidimensional signals is a strongly non-linear problem to which a two-step solution is here presented. First, the problem is lineariz...
SAC
2010
ACM
14 years 2 months ago
2010
ACM
Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensor...