793 search results - page 21 / 159 » Efficient computation of the characteristic polynomial |
CAGD
2008
13 years 7 months ago
2008
We describe a new subdivision method to efficiently compute the topology and the arrangement of implicit planar curves. We emphasize that the output topology and arrangement are g...
Publication
Using a trace of address references, we compared the efficiency of several different hashing functions, such as cyclic redundancy checking (CRC) polynomials, Fletcher checksum, fol...
FAW
2010
Springer
13 years 7 months ago
2010
Springer
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
In this paper, we introduce a novel discriminative feature space which is efficient not only for face detection but also for recognition. The face representation is based on local...
TSP
2008
13 years 7 months ago
2008
This correspondence presents new approaches for optimizing kurtosis-based separation criteria in the case of long mixture recordings. Our methods are based on a multivariate polyno...