2393 search results - page 272 / 479 » Adaptive Narrative Abstraction |
178
click to vote
VLSID
2000
IEEE
15 years 11 months ago
2000
IEEE
We consider the problem of timing analysis in the presence of known false paths. The main difficulty in adaptation of classical breadth-first search to the problem is that at each...
186
click to vote
CPM
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. We present a solution to the problem of performing approximate pattern matching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 an...
207
click to vote
CRYPTO
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. The paradigms currently used to realize symmetric encryption schemes secure against adaptive chosen ciphertext attack (CCA) try to make it infeasible for an attacker to f...
158
click to vote
SIGMETRICS
1999
ACM
15 years 11 months ago
1999
ACM
ded Abstract This paper introduces a new technique for compressing memory address traces. The technique relies on the simple observation that most programs spend their time execut...
177
click to vote
INFOCOM
1999
IEEE
15 years 11 months ago
1999
IEEE
Abstract--CEDAR is an algorithm for QoS routing in ad hoc network environments. It has three key components: (a) the establishment and maintenance of a self-organizing routing infr...