1686 search results - page 282 / 338 » Programs as polygraphs: computability and complexity |
FC
2007
Springer
15 years 3 months ago
2007
Springer
1 2 There is a critical need in computer security to communicate risks and thereby enable informed decisions by naive users. Yet computer security has not been engaged with the sc...
EMSOFT
2007
Springer
15 years 3 months ago
2007
Springer
Most recent embedded systems use caches to improve their average performance. Current timing analyses are able to compute safe timing guarantees for these systems, if tasks are ru...
EUROCAST
2007
Springer
15 years 1 months ago
2007
Springer
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
123
click to vote
JOBIM
2000
15 years 1 months ago
2000
Protein-protein interactions are critical to many biological processes, extending from the formation of cellular macromolecular structures and enzymatic complexes to the regulation...
VIS
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper presents a signed distance transform algorithm using graphics hardware, which computes the scalar valued function of the Euclidean distance to a given manifold of co-di...