3625 search results - page 171 / 725 » On choosing |
194
click to vote
ASIACRYPT
2000
Springer
15 years 11 months ago
2000
Springer
Rather than use a shared key directly to cryptographically process (e.g. encrypt or authenticate) data one can use it as a master key to derive subkeys, and use the subkeys for the...
162
click to vote
CP
2000
Springer
15 years 11 months ago
2000
Springer
Random Noise and Random Walk algorithms are local search strategies that have been used for the problem of satisfiability testing (SAT). We present a Markov-chain based analysis o...
210
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...
194
click to vote
CPM
2000
Springer
15 years 11 months ago
2000
Springer
We present a Boyer-Moore approach to string matching over LZ78 and LZW compressed text. The key idea is that, despite that we cannot exactly choose which text characters to inspect...
173
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
We compare the performance of a variant of the standard Dynamic Alternative Routing (DAR) technique commonly used in telephone and ATM networks to a path selection algorithm that ...