113 search results - page 14 / 23 » Fast algorithms for discrete polynomial transforms |
DOCENG
2006
ACM
14 years 2 months ago
2006
ACM
With the advent of XML we have seen a renewed interest in methods for computing the difference between trees. Methods that include heuristic elements play an important role in pr...
ICASSP
2008
IEEE
14 years 3 months ago
2008
IEEE
We consider the problem of planar object registration on binary images where the aligning transformation is restricted to the group of affine transformations. Previous approaches...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
IEAAIE
2003
Springer
14 years 1 months ago
2003
Springer
The attribute selection techniques for supervised learning, used in the preprocessing phase to emphasize the most relevant attributes, allow making models of classification simple...
DAC
1997
ACM
14 years 24 days ago
1997
ACM
: Numerous fast algorithms for the Discrete Cosine Transform DCT have been proposed. Until recently, it has been di cult to compare di erent DCT algorithms and select one which i...