611 search results - page 11 / 123 » Index Sets of Computable Structures with Decidable Theories |
148
Voted
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
A one-sided (resp. two-sided) shift of finite type of dimension one can be described as the set of infinite (resp. bi-infinite) sequences of consecutive edges in a finite-state aut...
128
Voted
APAL
1998
15 years 3 months ago
1998
We consider the computably enumerable sets under the relation of Qreducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, RQ, ≤Q , under ...
149
Voted
CIKM
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
117
Voted
FOSSACS
2010
Springer
15 years 10 months ago
2010
Springer
For many application-level distributed protocols and parallel algorithms, the set of participants, the number of messages or the interaction structure are only known at run-time. T...
143
Voted
SIAMCOMP
1998
15 years 3 months ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...