Sciweavers

494 search results - page 74 / 99
» Polynomial Equivalence Problems: Algorithmic and Theoretical...
Sort
View
ICALP
2009
Springer
14 years 8 months ago
Fast FAST
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
Noga Alon, Daniel Lokshtanov, Saket Saurabh
STACS
1998
Springer
13 years 12 months ago
On Disguised Double Horn Functions and Extensions
We consider Boolean functions represented by decision lists, and study their relationships to other classes of Boolean functions. It turns out that the elementary class of 1-decis...
Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
SMA
2005
ACM
131views Solid Modeling» more  SMA 2005»
14 years 1 months ago
Manifold splines
Constructing splines whose parametric domain is an arbitrary manifold and effectively computing such splines in realworld applications are of fundamental importance in solid and ...
Xianfeng Gu, Ying He 0001, Hong Qin
CAD
2007
Springer
13 years 7 months ago
Computing general geometric structures on surfaces using Ricci flow
Systematically generalizing planar geometric algorithms to manifold domains is of fundamental importance in computer aided design field. This paper proposes a novel theoretic fra...
Miao Jin, Feng Luo 0002, Xianfeng David Gu
SPLC
2008
13 years 9 months ago
Filtered Cartesian Flattening: An Approximation Technique for Optimally Selecting Features while Adhering to Resource Constraint
Software Product-lines (SPLs) use modular software components that can be reconfigured into different variants for different requirements sets. Feature modeling is a common method...
Jules White, B. Doughtery, Douglas C. Schmidt