882 search results - page 18 / 177 » On self-embeddings of computable linear orderings |
RT
1999
Springer
13 years 11 months ago
1999
Springer
A visibility algorithm for triangulated panoramas is proposed. The algorithm can correctly resolve the visibility without making use of any depth information. It is especially usef...
JSCIC
2007
13 years 7 months ago
2007
In this paper, we extend the adjoint error correction of Pierce and Giles [SIAM Review, 42 (2000), pp. 247-264] for obtaining superconvergent approximations of functionals to Gale...
ICRA
1995
IEEE
13 years 11 months ago
1995
IEEE
A systematic approach to the modeling of deformable ne linear objects is presented. Various deformable objects are manipulated in many manufacturing processes. Deformation of the...
CSR
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Ordering constraints are analogous to instances of the satisfiability problem in conjunctive normalform, but instead of a boolean assignment we consider a linear orderin...
IWPEC
2004
Springer
14 years 23 days ago
2004
Springer
Let G = V; E be a graph. The linear-width of G is de ned as the smallest integer k such that E can be arranged in a linear ordering e1; : : : ; er such that for every i = 1; :...