1379 search results - page 50 / 276 » The Complexity of the Annihilating Polynomial |
102
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...
STOC
2010
ACM
15 years 7 months ago
2010
ACM
In this paper we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutativ...
ICCAD
2004
IEEE
15 years 7 months ago
2004
IEEE
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...
PDCAT
2009
Springer
15 years 4 months ago
2009
Springer
Abstract— In symbolic computation, polynomial multiplication is a fundamental operation akin to matrix multiplication in numerical computation. We present efficient implementati...
BIRTHDAY
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. This paper investigates how to apply the techniques on solving semi-algebraic systems to invariant generation of polynomial programs. By our approach, the generated invar...