Sciweavers

1017 search results - page 15 / 204
» Register computations on ordinals
Sort
View
ICCV
2007
IEEE
14 years 9 months ago
Illumination and Affine- Invariant Point Matching using an Ordinal Approach
We present an approach for illumination and affineinvariant point matching using ordinal features. Ordinal measures for matching only consider the order between pixels and not the...
Raj Gupta, Anurag Mittal
CVPR
2008
IEEE
14 years 9 months ago
Boosting ordinal features for accurate and fast iris recognition
In this paper, we present a novel iris recognition method based on learned ordinal features.Firstly, taking full advantages of the properties of iris textures, a new iris represen...
Zhaofeng He, Zhenan Sun, Tieniu Tan, Xianchao Qiu,...
APAL
2011
13 years 2 months ago
The Suslin operator in applicative theories: Its proof-theoretic analysis via ordinal theories
The Suslin operator E1 is a type-2 functional testing for the wellfoundedness of binary relations on the natural numbers. In the context of applicative theories, its proof-theoret...
Gerhard Jäger, Dieter Probst
LICS
2008
IEEE
14 years 2 months ago
The Ordinal Recursive Complexity of Lossy Channel Systems
We show that reachability and termination for lossy channel systems is exactly at level Fωω in the Fast-Growing Hierarchy of recursive functions, the first level that dominates...
Pierre Chambart, Ph. Schnoebelen
ICALP
2009
Springer
14 years 8 months ago
Universal Succinct Representations of Trees?
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
Arash Farzan, Rajeev Raman, S. Srinivasa Rao