96 search results - page 14 / 20 » Improved Algorithms for Approximate String Matching (Extende... |
STOC
2000
ACM
15 years 2 months ago
2000
ACM
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
IROS
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— This paper introduces a method of building topological maps using sequences of images and the approximate string matching algorithm, which is commonly used in DNA seque...
WOB
2004
14 years 11 months ago
2004
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...
101
click to vote
SAGT
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
APPROX
2011
Springer
13 years 9 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...