239 search results - page 35 / 48 » Dynamic Response Time Optimization for SDF Graphs |
ICDM
2007
IEEE
14 years 1 months ago
2007
IEEE
We consider the problem of elastic matching of sequences of real numbers. Since both a query and a target sequence may be noisy, i.e., contain some outlier elements, it is desirab...
UAI
2004
13 years 9 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
DBSEC
2006
13 years 9 months ago
2006
Abstract. Attack graph is important in defending against well-orchestrated network intrusions. However, the current analysis of attack graphs requires an algorithm to be developed ...
ICSE
2004
IEEE-ACM
14 years 7 months ago
2004
IEEE-ACM
Dynamic slicing is a well-known program debugging technique. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some var...
IDEAS
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper proposes CADRE (Collaborative Allocation and Deallocation of Replicas with Efficiency), a dynamic replication scheme for improving the typically low data availability ...