1421 search results - page 47 / 285 » Algorithms for subsequence combinatorics |
117
click to vote
CPM
2000
Springer
15 years 7 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...
124
click to vote
COCOON
1999
Springer
15 years 7 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
136
click to vote
COCOON
2006
Springer
15 years 6 months ago
2006
Springer
We define a language to be overlap-free if any two distinct strings in the language do not overlap with each other. We observe that overlap-free languages are a proper subfamily of...
126
click to vote
COCOON
2006
Springer
15 years 6 months ago
2006
Springer
In this paper we present approximation results for the class constrained bin packing problem that has applications to Video-on-Demand Systems. In this problem we are given bins of...
111
click to vote
COCOON
2008
Springer
15 years 4 months ago
2008
Springer
Given a class of graphs, G, a graph G is a probe graph of G if its vertices can be partitioned into two sets, P (the probes) and N (the nonprobes), where N is an independent set, s...