60 search results - page 2 / 12 » Bounds for parametric sequence comparison |
CAGD
2008
13 years 7 months ago
2008
When fitting a parametric curve through a sequence of points, it is important in applications that the curve should not exhibit unwanted oscillations. In this paper we take the vi...
JUCS
2007
13 years 7 months ago
2007
Abstract: The recent interest in isolating real roots of polynomials has revived interest in computing sharp upper bounds on the values of the positive roots of polynomials. Until ...
BMCBI
2005
13 years 7 months ago
2005
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
FOCS
1998
IEEE
13 years 11 months ago
1998
IEEE
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
COCOON
2008
Springer
13 years 9 months ago
2008
Springer
A unified framework is applied to solving various sequence comparison problems for run-length encoded strings. All of these algorithms take O(min{mn , m n}) time and O(max{m, n}) s...