Sciweavers

1552 search results - page 7 / 311
» On the Complexity of Constant Propagation
Sort
View
MASCOTS
2003
14 years 11 months ago
Computer Virus Propagation Models
Abstract. The availability of reliable models of computer virus propagation would prove useful in a number of ways, in order both to predict future threats, and to develop new cont...
Giuseppe Serazzi, Stefano Zanero
IPMI
2009
Springer
15 years 10 months ago
Diffusion Propagator Imaging: Using Laplace's Equation and Multiple Shell Acquisitions to Reconstruct the Diffusion Propagator
Many recent single-shell high angular resolution diffusion imaging reconstruction techniques have been introduced to reconstruct orientation distribution functions (ODF) that only ...
Maxime Descoteaux, Rachid Deriche, Denis Le Bihan,...
POPL
2008
ACM
15 years 9 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
STOC
1996
ACM
97views Algorithms» more  STOC 1996»
15 years 1 months ago
Deterministic Restrictions in Circuit Complexity
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
Shiva Chaudhuri, Jaikumar Radhakrishnan