Sciweavers

229 search results - page 12 / 46
» Speeding Up Two String-Matching Algorithms
Sort
View
AMC
2005
256views more  AMC 2005»
13 years 7 months ago
Improved DSA variant for batch verification
Batch verification is a method to verify multiple signatures at once. There are two issues associated with batch verification. One is the security problem and the other is the com...
Chu-Hsing Lin, Ruei-Hau Hsu, Lein Harn
TIT
2011
152views more  TIT 2011»
13 years 1 months ago
Fast Exponentiation Using Split Exponents
Abstract—We propose a new method to speed up discrete logarithm (DL)-based cryptosystems by considering a new variant of the DL problem, where the exponents are formed as e1 + α...
Jung Hee Cheon, Stanislaw Jarecki, Taekyoung Kwon,...
PPSN
2010
Springer
13 years 5 months ago
More Effective Crossover Operators for the All-Pairs Shortest Path Problem
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
Benjamin Doerr, Daniel Johannsen, Timo Kötzin...
IPPS
2009
IEEE
14 years 2 months ago
Building a parallel pipelined external memory algorithm library
Large and fast hard disks for little money have enabled the processing of huge amounts of data on a single machine. For this purpose, the well-established STXXL library provides a...
Andreas Beckmann, Roman Dementiev, Johannes Single...
AMAI
2004
Springer
14 years 27 days ago
Improving Exact Algorithms for MAX-2-SAT
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...
Haiou Shen, Hantao Zhang