1421 search results - page 80 / 285 » Algorithms for subsequence combinatorics |
136
click to vote
IJFCS
2006
15 years 4 months ago
2006
Abstract. Local similarity computation between two sequences permits detecting all the relevant alignments present between subsequences thereof. A well-known dynamic programming al...
115
click to vote
COCOON
2009
Springer
15 years 10 months ago
2009
Springer
We provide a smoothed analysis of Hoare’s find algorithm and we revisit the smoothed analysis of quicksort. Hoare’s find algorithm – often called quickselect – is an easy...
130
click to vote
ECIR
2009
Springer
16 years 1 months ago
2009
Springer
Algorithms that enable the process of automatically mining distinct topics in document collections have become increasingly important due to their applications in many fields and ...
120
Voted
SPIRE
2007
Springer
15 years 10 months ago
2007
Springer
The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to dev...
130
click to vote
ICRA
1998
IEEE
15 years 8 months ago
1998
IEEE
This paper describes the new localisation algorithms under implementation for the mail distributing mobile robot, MOPS, of the Institute of Robotics, Swiss Federal Institute of Te...