364 search results - page 14 / 73 » Generalized normal forms and polynomial system solving |
67
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We show that a fast algorithm for the QR factorization of a Toeplitz or Hankel matrix A is weakly stable in the sense that RT R is close to AT A. Thus, when the algorithm is used ...
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
CSJM
2008
14 years 9 months ago
2008
In 1993 Koblitz and Fellows proposed a public key cryptosystem, Polly Cracker, based on the problem of solving multivariate systems of polynomial equations, which was soon general...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
Form mapping is the key problem that needs to be solved in order to get access to the hidden web. Currently available solutions for fully automatic mapping are not ready for comme...
60
Voted
TCOM
2008
14 years 9 months ago
2008
This paper proposes a general and systematic code design method to efficiently combine constrained codes with parity-check (PC) codes for optical recording. The proposed constraine...