4066 search results - page 214 / 814 » Almost Complete Sets |
144
click to vote
ORDER
2010
15 years 5 months ago
2010
We investigate the complexity of the lattice of local clones over a countably infinite base set. In particular, we prove that this lattice contains all algebraic lattices with at ...
168
click to vote
TSD
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we present a novel method for adaptation of a multi-layer perceptron neural network (MLP ANN). Nowadays, the adaptation of the ANN is usually done as an incremental r...
188
click to vote
ACL
2009
15 years 4 months ago
2009
We developed caitra, a novel tool that aids human translators by (a) making suggestions for sentence completion in an interactive machine translation setting, (b) providing altern...
181
click to vote
JCSS
2011
15 years 1 months ago
2011
For any class C closed under TC0 reductions, and for any measure u of uniformity containing Dlogtime, it is shown that all sets complete for C under u-uniform AC0 reductions are i...
158
click to vote
NDJFL
2010
15 years 1 months ago
2010
We study completely decomposable torsion-free abelian groups of the form GS := nSQpn for sets S . We show that GS has a decidable copy if and only if S is 0 2 and has a computable...