4581 search results - page 197 / 917 » Computing Transformation Semigroups |
169
click to vote
CVPR
1997
IEEE
15 years 10 months ago
1997
IEEE
Multiple images of a scene are related through 20/3D view transformations and linear and non-linear camera transformations. In all the traditional techniques to compute these tran...
196
click to vote
PACT
2009
Springer
16 years 1 months ago
2009
Springer
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...
172
click to vote
DGCI
2006
Springer
15 years 10 months ago
2006
Springer
Duality applied to geometrical problems is widely used in many applications in computer vision or computational geometry. A classical example is the Hough Transform to detect linea...
158
click to vote
JMLR
2010
15 years 1 months ago
2010
As we devise more complicated prior distributions, will inference algorithms keep up? We highlight a negative result in computable probability theory by Ackerman, Freer, and Roy (...
166
click to vote
GCC
2003
Springer
15 years 11 months ago
2003
Springer
Grid computing is used to realize the connection of distributed, heterogeneous computing resources through grid, assist in accomplishing computing task. Focusing on the weakness of...