4581 search results - page 107 / 917 » Computing Transformation Semigroups |
110
Voted
ERSHOV
2003
Springer
15 years 7 months ago
2003
Springer
We provide a polymorphic framework for radix-n Fast Fourier Transforms (FFTs) where all known kinds of monomoporhic radix-n algorithms can be obtained by specialization. The framew...
149
Voted
SIGGRAPH
1999
ACM
15 years 7 months ago
1999
ACM
Traditionally, shape transformation using implicit functions is performed in two distinct steps: 1) creating two implicit functions, and 2) interpolating between these two functio...
118
Voted
VISUALIZATION
2000
IEEE
15 years 7 months ago
2000
IEEE
In this paper, we present a new technique for extracting regions of interest (ROI) applying a local watershed transformation. The proposed strategy for computing catchment basins ...
128
Voted
HIPC
2007
Springer
15 years 8 months ago
2007
Springer
The Fast Fourier Transform (FFT) is of primary importance and a fundamental kernel in many computationally intensive scientific applications. In this paper we investigate its perf...
133
Voted
DATE
2010
IEEE
15 years 7 months ago
2010
IEEE
—Motion Estimation (ME) is the most computationally intensive part of video compression and video enhancement systems. One bit transform (1BT) based ME algorithms have low comput...