429 search results - page 72 / 86 » Turing computations on ordinals |
102
Voted
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
In this paper, we present an enhanced Pictorial Struc-
ture (PS) model for precise eye localization, a fundamen-
tal problem involved in many face processing tasks. PS is
a comp...
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
FSTTCS
2005
Springer
15 years 3 months ago
2005
Springer
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
ENTCS
2007
14 years 9 months ago
2007
As a first step toward a notion of quantum data structures, we introduce a typing system for reflecting entanglement and separability. This is presented in the context of classi...
MST
1998
14 years 9 months ago
1998
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...