882 search results - page 52 / 177 » On self-embeddings of computable linear orderings |
102
click to vote
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
This paper proposes a method to recover the embedding
of the possible shapes assumed by a deforming nonrigid
object by comparing triplets of frames from an orthographic
video se...
CCA
2009
Springer
15 years 4 months ago
2009
Springer
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...
GD
2003
Springer
15 years 3 months ago
2003
Springer
A graph with an ordered k-partition of the vertices is radial level planar if there is a strictly outward drawing on k concentric levels without crossings. Radial level planarity ...
PARELEC
2006
IEEE
15 years 3 months ago
2006
IEEE
processor arrays can be used as accelerators for a plenty of data flow-dominant applications. The explosive growth in research and development of massively parallel processor arr...
CSL
2007
Springer
15 years 4 months ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...