1215 search results - page 155 / 243 » Combinatorics |
120
click to vote
COCOON
2001
Springer
15 years 8 months ago
2001
Springer
We consider one-dimensional and multi-dimensional vector covering with variable sized bins. In the one-dimensional case, we consider variable sized bin covering with bounded item ...
118
click to vote
CPM
2001
Springer
15 years 8 months ago
2001
Springer
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
127
click to vote
CPM
2001
Springer
15 years 8 months ago
2001
Springer
Directed Acyclic Word Graph (DAWG) is a space efficient data structure that supports indices of a string. Compact Directed Acyclic Word Graph (CDAWG) is a more space efficient vari...
132
click to vote
CPM
2001
Springer
15 years 8 months ago
2001
Springer
We present a solution to the problem of regular expression searching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 and LZW variants. Give...
122
Voted
COCOON
2000
Springer
15 years 7 months ago
2000
Springer
The integer factorisation and discrete logarithm problems are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presum...