Sciweavers

1554 search results - page 13 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
CPM
2005
Springer
87views Combinatorics» more  CPM 2005»
14 years 2 months ago
Two Dimensional Parameterized Matching
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-...
Carmit Hazay, Moshe Lewenstein, Dekel Tsur
STACS
2010
Springer
14 years 3 months ago
Treewidth Reduction for Constrained Separation and Bipartization Problems
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...
Dániel Marx, Barry O'Sullivan, Igor Razgon
TVCG
2008
169views more  TVCG 2008»
13 years 8 months ago
Adaptive Geometry Image
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 ...
Chih-Yuan Yao, Tong-Yee Lee
IJIT
2004
13 years 10 months ago
Learning of Class Membership Values by Ellipsoidal Decision Regions
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...
Leehter Yao, Chin-chin Lin
GRAPHICSINTERFACE
1997
13 years 10 months ago
Multiresolution Rendering of Complex Botanical Scenes
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...
Dana Marshall, Donald S. Fussell, A. T. Campbell I...