4940 search results - page 181 / 988 » On the Complexity of Universal Programs |
167
click to vote
ECCC
2007
15 years 6 months ago
2007
Program checking, program self-correcting and program selftesting were pioneered by [Blum and Kannan] and [Blum, Luby and Rubinfeld] in the mid eighties as a new way to gain conï¬...
153
click to vote
ICIP
2001
IEEE
16 years 8 months ago
2001
IEEE
This paper proposes several low complexity algorithmic modifications to the SPIHT (Set Partitioning in Hierarchical Trees) image coding method of [3]. The modifications exploit un...
196
click to vote
FSE
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexit...
167
click to vote
PLILP
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. Teaching introductory computing courses with Scheme elevates the intellectual level of the course and thus makes the subject more appealing to students with scienti c int...
171
click to vote
CASCON
1993
15 years 7 months ago
1993
The growth of commercial and academic interest in parallel and distributed computing during the past fifteen years has been accompanied by a corresponding increase in the number o...