146 search results - page 6 / 30 » Computably Enumerable Sets and Quasi-Reducibility |
DCC
2010
IEEE
14 years 4 months ago
2010
IEEE
We present a technique that compresses a string w by enumerating all the substrings of w. The substrings are enumerated from the shortest to the longest and in lexicographic order...
APAL
2005
13 years 9 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...
MOBIHOC
2003
ACM
14 years 9 months ago
2003
ACM
The development of lightweight sensing and communication protocols is a key requirement for designing resource constrained sensor networks. This paper introduces a set of efficien...
IEEEPACT
2002
IEEE
14 years 2 months ago
2002
IEEE
Traditional compilers perform their code generation tasks based on a fixed, pre-determined instruction set. This paper describes the implementation of a compiler that determines ...
CASES
2004
ACM
14 years 1 months ago
2004
ACM
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. However, it is computationally expensive to automaticall...