Sciweavers

260 search results - page 8 / 52
» Hardness of Parameterized Resolution
Sort
View
EUROIMSA
2006
111views Multimedia» more  EUROIMSA 2006»
13 years 9 months ago
Exaggeration of Extremely Detailed 3D Faces
Exaggeration is often used in art and entertainment to capture the interest and attention of an audience. We present an approach to automatically exaggerate the distinctive featur...
Andrew Soon, Won-Sook Lee
MICCAI
2009
Springer
14 years 7 months ago
Tensor-Based Morphometry with Mappings Parameterized by Stationary Velocity Fields in Alzheimer's Disease Neuroimaging Initiativ
Tensor-based morphometry (TBM) is an analysis technique where anatomical information is characterized by means of the spatial transformations between a customized template and obse...
Ernesto Zacur, Matías Nicolás Bossa,...
FAW
2008
Springer
104views Algorithms» more  FAW 2008»
13 years 9 months ago
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
Michael Dom, Somnath Sikdar
CIAC
2010
Springer
281views Algorithms» more  CIAC 2010»
13 years 4 months ago
Parameterized Complexity of Even/Odd Subgraph Problems
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...
Leizhen Cai, Boting Yang
IWPEC
2009
Springer
14 years 2 months ago
The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
Panos Giannopoulos, Christian Knauer, Günter ...