Sciweavers

1017 search results - page 4 / 204
» Register computations on ordinals
Sort
View
HPCA
2012
IEEE
12 years 3 months ago
Flexible register management using reference counting
Conventional out-of-order processors that use a unified physical register file allocate and reclaim registers explicitly using a free list that operates as a circular queue. We ...
Steven Battle, Andrew D. Hilton, Mark Hempstead, A...
RTA
1997
Springer
13 years 11 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...
ACMACE
2006
ACM
14 years 1 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
CVPR
2011
IEEE
13 years 3 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
FSTTCS
2009
Springer
14 years 2 months 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