1055 search results - page 59 / 211 » Enumerations in computable structure theory |
MOC
1998
14 years 9 months ago
1998
We use the algorithmic computation of exact sequences of Abelian groups to compute the complete structure of (ZK /m)∗ for an ideal m of a number field K, as well as ray class gr...
ICCV
2007
IEEE
15 years 4 months ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
INFORMATICALT
2007
14 years 9 months ago
2007
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
LOGCOM
2010
14 years 8 months ago
2010
The algebraic theory of quasi-MV algebras, generalisations of MV algebras arising in quantum computation, is by now rather well-developed. Although it is possible to define sever...
BC
1999
14 years 9 months ago
1999
Abstract. This paper discusses similarities between models of adaptive motor control suggested by recent experiments with human and animal subjects, and the structure of a new cont...