14190 search results - page 174 / 2838 » computer 2008 |
175
click to vote
HASE
2008
IEEE
15 years 11 months ago
2008
IEEE
Due to the large number of attacks on open networks, information theft becomes a more and more severe problem. Secure computation can offer highly assured confidentiality protecti...
110
click to vote
IPPS
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper proposes an optimization technique for spotchecking to minimize the computation time of volunteer computing (VC) systems with malicious participants who return erroneou...
348
click to vote
SIGCSE
2008
ACM
15 years 4 months ago
2008
ACM
Generating interest in specialized areas of Computer Science (CS) is one of the goals of the department of Computer and Information Science at Spelman College as with most departm...
144
click to vote
ENTCS
2011
14 years 11 months ago
2011
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
134
click to vote
TCS
2002
15 years 4 months ago
2002
We study the relationship between a computably enumerable real and its presentations: ways of approximating the real by enumerating a prefix-free set of binary strings.