882 search results - page 105 / 177 » On self-embeddings of computable linear orderings |
ICASSP
2010
IEEE
15 years 25 days ago
2010
IEEE
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
120
Voted
ICPR
2010
IEEE
15 years 24 days ago
2010
IEEE
—Patch-based face recognition is a recent method which uses the idea of analyzing face images locally, in order to reduce the effects of illumination changes and partial occlusio...
ENDM
2006
15 years 19 days ago
2006
The students of the Industrial Design department at the TU Eindhoven are allowed to design part of their curriculum by selecting courses from a huge course pool. They do this by ha...
118
Voted
JACM
2010
14 years 11 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
122
Voted
JMLR
2010
14 years 11 months ago
2010
Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...