304 search results - page 7 / 61 » An Efficient Method for Evaluating Complex Polynomials |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polyn...
MOR
2002
13 years 7 months ago
2002
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
In the perspective next generation Air Traffic Management (ATM) systems, aircraft will be endowed with part of the responsibility for separation maintenance, and traffic complexity...
ISSAC
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we present an improved method for decomposing multivariate polynomials. This problem, also known as the Functional Decomposition Problem (FDP) [17, 9, 27], is class...
EMNLP
2008
13 years 9 months ago
2008
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...