6045 search results - page 395 / 1209 » Computable Linearizations of Well-partial-orderings |
363
click to vote
Book
"The Discrete Fourier Transform (DFT) can be understood as a numerical approximation to the Fourier transform. However, the DFT has its own exact Fourier theory, which is the ...
180
click to vote
CVPR
1999
IEEE
16 years 9 months ago
1999
IEEE
A technique is presented for representing linear features as probability density functions in two or three dimensions. Three chief advantages of this approach are (1) a unified re...
184
click to vote
ICCV
2005
IEEE
16 years 9 months ago
2005
IEEE
We propose an algorithm to recognize faces illuminated by arbitrarily placed, multiple light sources. The algorithm does not need to know the number of light sources and works extr...
209
Voted
ICCV
2005
IEEE
16 years 9 months ago
2005
IEEE
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
175
click to vote
ICPR
2008
IEEE
16 years 9 months ago
2008
IEEE
We introduce a class of geodesic distances and extend the K-means clustering algorithm to employ this distance metric. Empirically, we demonstrate that our geodesic K-means algori...