4940 search results - page 562 / 988 » On the Complexity of Universal Programs |
161
click to vote
GLOBECOM
2007
IEEE
16 years 1 months ago
2007
IEEE
Abstract—In Chebyshev finite-impulse response (FIR) equalization, we design an FIR filter that minimizes the Chebyshev equalization error, i.e., the maximum absolute deviation ...
167
click to vote
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
The excessive complexity of both machine architectures and applications have made it difficult for compilers to statically model and predict application behavior. This observatio...
179
click to vote
CIE
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
186
click to vote
LADS
2007
Springer
16 years 28 days ago
2007
Springer
One of the main reasons about the success of the Web is that many “regular users” are able to create Web pages that, using hyperlinks, incrementally extend both the size and th...
192
click to vote
WDAG
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...