793 search results - page 24 / 159 » Efficient computation of the characteristic polynomial |
PR
2006
13 years 7 months ago
2006
9 Legendre orthogonal moments have been widely used in the field of image analysis. Because their computation by a direct method is very time expensive, recent efforts have been d...
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...
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
Mobile video processing as defined in standards like MPEG-4 and H.263 contains a number of timeconsuming computations that cannot be efficiently executed on current hardware archi...
AICCSA
2006
IEEE
14 years 1 months ago
2006
IEEE
Collaborative signal processing is one of the most promising applications that are currently being investigated for sensor networks. In this paper, we use FFT computation as a veh...
CLUSTER
2005
IEEE
14 years 1 months ago
2005
IEEE
Applications such as parallel computing, online games, and content distribution networks need to run on a set of resources with particular network connection characteristics to ge...