17760 search results - page 186 / 3552 » A Generalization of the Massey-Ding Algorithm |
137
click to vote
IJAC
2008
15 years 4 months ago
2008
We describe a nilpotent quotient algorithm for a certain type of infinite presentations: the so-called finite L-presentations. We then exhibit finite L-presentations for various i...
129
click to vote
WG
2009
Springer
15 years 11 months ago
2009
Springer
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...
130
click to vote
JGAA
2007
15 years 4 months ago
2007
In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are ...
132
click to vote
DIS
2001
Springer
15 years 8 months ago
2001
Springer
Episode pattern is a generalized concept of subsequence pattern where the length of substring containing the subsequence is bounded. Given two sets of strings, consider an optimiza...
129
click to vote
CA
2000
IEEE
15 years 8 months ago
2000
IEEE
A list of representative directional prepositions of the English language is investigated to develop computation models that output some general motion trajectory or goal directio...