178 search results - page 21 / 36 » Fast Algorithms for Top-k Approximate String Matching |
STOC
2000
ACM
15 years 1 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 ...
70
Voted
MST
2006
14 years 9 months ago
2006
In the late eighties, it was shown that juggling patterns can be described by strings of numbers with fascinating combinatorial properties that have since then been studied by man...
92
Voted
CLEF
2010
Springer
14 years 4 months ago
2010
Springer
Nowadays, plagiarism has been presented as one of the main distresses that the information technology revolution has lead into our society for which using pattern matching algorith...
77
Voted
APPROX
2006
Springer
15 years 1 months ago
2006
Springer
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span "contains" a matrix of rank at most k with error only (1 + ) times the er...
ECCV
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...