882 search results - page 26 / 177 » On self-embeddings of computable linear orderings |
ICIP
2001
IEEE
14 years 9 months ago
2001
IEEE
The use of higher-order local autocorrelations as features for pattern recognition has been acknowledged since many years, but their applicability was restricted to relatively low...
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
AAECC
1998
Springer
13 years 7 months ago
1998
Springer
The set of all linear recurrence relations satisfied by given sequences of finite length is described by the annihilator ideal of the sequences. The MasseyDing algorithm to compu...
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
In pattern recognition, computer vision, and image processing, many approaches are based on second order operators. Well-known examples are second order networks, the 3D structure...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. A lexicographic ranking function for the set of all permutations of n ordered symbols translates permutations to their ranks in the lexicographic order of all permutation...