Sciweavers

163 search results - page 25 / 33
» Improving the Context-sensitive Dependency Graph
Sort
View
DNA
2001
Springer
139views Bioinformatics» more  DNA 2001»
13 years 12 months ago
DNA Computing in Microreactors
Abstract. The goal of this research is to improve the programmability of DNA-based computers. Novel clockable microreactors can be connected in various ways to solve combinatorial ...
Danny van Noort, Frank-Ulrich Gast, John S. McCask...
DATE
1997
IEEE
89views Hardware» more  DATE 1997»
13 years 11 months ago
Cone-based clustering heuristic for list-scheduling algorithms
List scheduling algorithms attempt to minimize latency under resource constraints using a priority list. We propose a new heuristic that can be used in conjunction with any priori...
Sriram Govindarajan, Ranga Vemuri
CRYPTO
2006
Springer
92views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
Elad Barkan, Eli Biham, Adi Shamir
CCS
2008
ACM
13 years 9 months ago
Measuring network security using dynamic bayesian network
Given the increasing dependence of our societies on networked information systems, the overall security of these systems should be measured and improved. Existing security metrics...
Marcel Frigault, Lingyu Wang, Anoop Singhal, Sushi...
ISSTA
2010
ACM
13 years 9 months ago
Causal inference for statistical fault localization
This paper investigates the application of causal inference methodology for observational studies to software fault localization based on test outcomes and profiles. This methodo...
George K. Baah, Andy Podgurski, Mary Jean Harrold