790 search results - page 11 / 158 » Subexponential Parameterized Algorithms |
CPM
2005
Springer
14 years 4 months ago
2005
Springer
Two equal length strings, or two equal sized two-dimensional texts, parameterize match (p-match) if there is a one-one mapping (relative to the alphabet) of their characters. Two-...
ESA
2010
Springer
13 years 12 months ago
2010
Springer
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
COMPGEOM
2004
ACM
14 years 2 months ago
2004
ACM
We present the first complete, exact, and efficient C++ implementation for parameterizing the intersection of two implicit quadrics with integer coefficients of arbitrary size. It...
DAM
2008
13 years 11 months ago
2008
We discuss different variants of linear arrangement problems from a parameterized perspective. More specifically, we concentrate on developing simple search tree algorithms for th...
SYNASC
2006
IEEE
14 years 4 months ago
2006
IEEE
The paper focuses on means of defining parameterized type categories and algorithms built on such types in Mathematica. Symbolic algorithms based on category theory have the advan...