47 search results - page 6 / 10 » Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Co... |
BIRD
2008
Springer
13 years 9 months ago
2008
Springer
Finding motifs in biological sequences is one of the most intriguing problems for string algorithms designers due to, on the one hand, the numerous applications of this problem in...
FSE
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
ECLIPSE
2004
ACM
14 years 23 days ago
2004
ACM
Programming courses of all levels rely heavily on code examples. Often, to cover non-trivial subjects, it is convenient to present examples in the form of a tutorial. Such tutoria...
TCS
2010
13 years 5 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
ADAEUROPE
2003
Springer
14 years 18 days ago
2003
Springer
ontainer. In particular, an iterator abstracts away differences in specific container types, allowing you to view the collection simply as a sequence of items. A generic algorith...