Sciweavers

118 search results - page 3 / 24
» Ordinal Computability
Sort
View
CIE
2007
Springer
13 years 11 months ago
The Complexity of Quickly ORM-Decidable Sets
Abstract. The Ordinal Register Machine (ORM) is one of several different machine models for infinitary computability. We classify, by complexity, the sets that can be decided quic...
Joel David Hamkins, David Linetsky, Russell G. Mil...
RTA
1997
Springer
13 years 9 months ago
A Complete Axiomatisation for the Inclusion of Series-Parallel Partial Orders
Series-parallel orders are de ned as the least class of partial orders containing the one-element order and closed by ordinal sum and disjoint union. From this inductive de nition,...
Denis Béchet, Philippe de Groote, Christian...
CVPR
2011
IEEE
13 years 1 months ago
Ordinal Hyperplanes Ranker with Cost Sensitivities for Age Estimation
In this paper, we propose an ordinal hyperplane ranking algorithm called OHRank, which estimates human ages via facial images. The design of the algorithm is based on the relative...
Kuang-Yu Chang, Chu-Song Chen, Yi-Ping Hung
ACMACE
2006
ACM
13 years 11 months ago
A fast eye location method using ordinal features
Automatic facial feature location is an important step in humancomputer interaction and automatic face recognition. In this paper, a new eye location method is proposed. A classif...
Xuetao Feng, Yangsheng Wang, Li Bai
FSTTCS
2009
Springer
14 years 6 days ago
Covering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
Laurent Braud