16666 search results - page 3019 / 3334 » Descriptive and Computational Complexity |
173
click to vote
HPCA
2004
IEEE
16 years 7 months ago
2004
IEEE
As microprocessors become increasingly complex, the techniques used to analyze and predict their behavior must become increasingly rigorous. This paper applies wavelet analysis te...
308
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
288
click to vote
POPL
2006
ACM
16 years 7 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
170
click to vote
RECOMB
2005
Springer
16 years 7 months ago
2005
Springer
Abstract. Recent studies demonstrating the existence of special non-coding "antisense" RNAs used in post-transcriptional gene regulation have received considerable attent...
161
click to vote
RECOMB
2005
Springer
16 years 7 months ago
2005
Springer
This paper proposes a novel tree decomposition based side-chain assignment algorithm, which can obtain the globally optimal solution of the side-chain packing problem very efficien...