448 search results - page 24 / 90 » Fast Approximation Algorithms for Multicommodity Flow Proble... |
LATIN
1998
Springer
15 years 1 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
CGF
2010
14 years 9 months ago
2010
This paper considers the problem of interactively finding the cutting contour to extract components from a given mesh. Some existing methods support cuts of arbitrary shape but re...
ISPEC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In this paper we address the problem of inefficiency of exact attack tree computations. We propose several implementation-level optimizations and introduce a genetic algo...
ECCV
2010
Springer
14 years 10 months ago
2010
Springer
Although the recent advances in the sparse representations of images have achieved outstanding denosing results, removing real, structured noise in digital videos remains a challen...
90
Voted
BMCBI
2010
14 years 9 months ago
2010
Background: There are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large,...