1552 search results - page 300 / 311 » On the Complexity of Constant Propagation |
113
click to vote
DFN
2003
15 years 1 months ago
2003
In recent years research activities in computer network security focus more actively on the development of effective methods in intrusion detection. The reason for this developmen...
SODA
2003
ACM
15 years 1 months ago
2003
ACM
Collusion-secure fingerprinting codes are an important primitive used by many digital watermarking schemes [1, 10, 9]. Boneh and Shaw [3] define a model for these types of codes...
AAAI
1996
15 years 1 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
SODA
1992
ACM
15 years 27 days ago
1992
ACM
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
GG
2008
Springer
15 years 24 days ago
2008
Springer
This event is the second instance of the contest for graph transformation-based tools, which was first held as part of the AGTIVE workshop. The aim is to stimulate tool developmen...