1554 search results - page 13 / 311 » Parameterized Complexity and Approximation Algorithms |
150
click to vote
CPM
2005
Springer
15 years 10 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-...
128
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
126
click to vote
TVCG
2008
15 years 3 months ago
2008
We present a novel postprocessing utility called adaptive geometry image (AGIM) for global parameterization techniques that can embed a 3D surface onto a rectangular1 domain. This ...
119
click to vote
IJIT
2004
15 years 5 months ago
2004
A novel method of learning complex fuzzy decision regions in the n-dimensional feature space is proposed. Through the fuzzy decision regions, a given pattern's class membershi...
172
click to vote
GRAPHICSINTERFACE
1997
15 years 5 months ago
1997
This paper presents a system for rendering very large collections of randomly parameterized plants while generating manageable scene geometries for rendering. A given botanical de...