1215 search results - page 160 / 243 » Combinatorics |
155
click to vote
COCOON
2006
Springer
15 years 10 months ago
2006
Springer
: Inferring graphs from path frequency has been studied as an important problem which has a potential application to drug design and elucidation of chemical structures. Given a mul...
176
click to vote
COCOON
2006
Springer
15 years 10 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...
150
click to vote
CPM
2006
Springer
15 years 10 months ago
2006
Springer
Given an ordered labeled forest F ("the target forest") and an ordered labeled forest G ("the pattern forest"), the most similar subforest problem is to find a ...
178
click to vote
CPM
2009
Springer
15 years 9 months ago
2009
Springer
In this paper we present in detail a new efficient linear time and space suffix array construction algorithm(SACA), called the D-CriticalSubstring algorithm. The algorithm is built...
182
click to vote
COCOON
2009
Springer
15 years 9 months ago
2009
Springer
We present new and more efficient algorithms for regular language enumeration problems. The min-word problem is to find the lexicographically minimal word of length n accepted by ...