1686 search results - page 302 / 338 » Programs as polygraphs: computability and complexity |
PODC
2000
ACM
14 years 3 months ago
2000
ACM
Stampede is a parallel programming system to facilitate the programming of interactive multimedia applications on clusters of SMPs. In a Stampede application, a variable number of...
DSN
2004
IEEE
14 years 2 months ago
2004
IEEE
The authors describe the use of bounded model checking (BMC) for verifying Web application code. Vulnerable sections of code are patched automatically with runtime guards, allowin...
ALT
1995
Springer
14 years 2 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
NSDI
2010
14 years 12 days ago
2010
: Making cloud services responsive is critical to providing a compelling user experience. Many largescale sites, including LinkedIn, Digg and Facebook, address this need by deployi...
ALMOB
2006
13 years 11 months ago
2006
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...