1686 search results - page 269 / 338 » Programs as polygraphs: computability and complexity |
HPCA
2003
IEEE
15 years 10 months ago
2003
IEEE
We consider the impact of different communication architectures on the performability (performance + availability) of cluster-based servers. In particular, we use a combination of ...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
DCC
2004
IEEE
15 years 9 months ago
2004
IEEE
We introduce three new innovations for compression using LDPCs for the Slepian-Wolf problem. The first is a general iterative Slepian-Wolf decoding algorithm that incorporates the...
CHI
2010
ACM
15 years 4 months ago
2010
ACM
End-user programmers’ code is notoriously buggy. This problem is amplified by the increasing complexity of end users’ programs. To help end users catch errors early and reliab...
GCB
2009
Springer
15 years 4 months ago
2009
Springer
Abstract: The analysis of RNA folding landscapes yields insights into the kinetic folding behavior not available from classical structure prediction methods. This is especially imp...