2766 search results - page 75 / 554 » Algorithms for trigonometric polynomials |
98
Voted
IJON
2006
15 years 23 days ago
2006
Equivariant Adaptive Separation via Independence (EASI) is one of the most successful algorithms for Blind Source Separation (BSS). However, the user has to choose nonlinearities,...
101
Voted
ECCC
1998
15 years 13 days ago
1998
In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of...
122
Voted
IWOCA
2010
Springer
14 years 7 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
103
Voted
ISSAC
2009
Springer
15 years 7 months ago
2009
Springer
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
86
Voted
CORR
2008
Springer
15 years 26 days ago
2008
Springer
We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a fami...