108 search results - page 19 / 22 » forte 2007 |
APAL
2005
14 years 11 months ago
2005
We investigate operators which take a set X to a set relatively computably enumerable in and above X by studying which such sets X can be so mapped into the Turing degree of K. We...
APAL
1998
14 years 11 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 ...
DGO
2004
15 years 1 months ago
2004
CORR
2007
Springer
14 years 12 months ago
2007
Springer
Kohonen self-organisation maps are a well know classification tool, commonly used in a wide variety of problems, but with limited applications in time series forecasting context....
ISSA
2008
15 years 1 months ago
2008
"The state of information security as a whole is a disaster, a train wreck". This view is given by Forte and Power (2007) describing the state of information security to...