62 search results - page 6 / 13 » Faster Algorithms for Computing Longest Common Increasing Su... |
99
Voted
FCT
2005
Springer
15 years 7 months ago
2005
Springer
Sequence comparison is a fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similaritie...
118
click to vote
ICPR
2004
IEEE
16 years 2 months ago
2004
IEEE
A system is described that tracks moving objects in a video dataset so as to extract a representation of the objects' 3D trajectories. The system then finds hierarchical clus...
118
Voted
TCBB
2010
15 years 5 days ago
2010
— We present efficient cache-oblivious algorithms for some well-studied string problems in bioinformatics including the longest common subsequence, global pairwise sequence alig...
141
Voted
IEEESCC
2009
IEEE
14 years 11 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
142
click to vote
WOB
2004
15 years 3 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...