3136 search results - page 81 / 628 » Comparison of Clique-Listing Algorithms |
186
click to vote
ESA
2004
Springer
15 years 11 months ago
2004
Springer
Sample sort, a generalization of quicksort that partitions the input into many pieces, is known as the best practical comparison based sorting algorithm for distributed memory para...
149
click to vote
ALENEX
2009
15 years 7 months ago
2009
We experimentally compare the two algorithms A and B by Fredman and Khachiyan [FK96] for the problem Monet--given two monotone Boolean formulas in DNF and in CNF, decide whether ...
164
click to vote
ICDE
2011
IEEE
14 years 10 months ago
2011
IEEE
—In comparison to the extensive body of existing work considering publish-once, static anonymization, dynamic anonymization is less well studied. Previous work, most notably
162
click to vote
CRYPTO
1993
Springer
15 years 10 months ago
1993
Springer
Three modular reduction algorithms for large integers are compared with respect to their performance in portable software: the classical algorithm, Barrett’s algorithm and Montgo...