6045 search results - page 905 / 1209 » Computable Linearizations of Well-partial-orderings |
152
click to vote
STOC
1996
ACM
15 years 11 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
191
Voted
CVPR
2009
IEEE
15 years 10 months ago
2009
IEEE
Nonnegative Matrix Factorization (NMF) approximates a given data matrix as a product of two low rank nonnegative matrices, usually by minimizing the L2 or the KL distance between ...
163
click to vote
ECCV
2006
Springer
15 years 10 months ago
2006
Springer
In many image analysis applications there is a need to extract curves in noisy images. To achieve a more robust extraction, one can exploit correlations of oriented features over a...
188
click to vote
ICCV
1995
IEEE
15 years 10 months ago
1995
IEEE
Estimating principal curvatures and principal directions of a surface from a polyhedral approximation with a large number of small faces, such as those produced by iso-surface con...
147
click to vote
ESANN
2007
15 years 8 months ago
2007
This paper proposes a novel nonlinear transient computation device described as the LTCM that uses the chaotic attractor provided by the Lorenz system of equations to perform patte...