1017 search results - page 11 / 204 » Register computations on ordinals |
LICS
1999
IEEE
13 years 12 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...
IPL
2000
13 years 7 months ago
2000
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons ...
ECIR
2009
Springer
14 years 4 months ago
2009
Springer
CIE
2005
Springer
14 years 1 months ago
2005
Springer
CVPR
2005
IEEE
14 years 1 months ago
2005
IEEE
Palmprint-based personal identification, as a new member in the biometrics family, has become an active research topic in recent years. Although great progress has been made, how ...