790 search results - page 44 / 158 » Subexponential Parameterized Algorithms |
122
click to vote
SIGGRAPH
2010
ACM
15 years 7 months ago
2010
ACM
We present a method for parameterizing subdivision surfaces in an as-rigid-as-possible fashion. While much work has concentrated on parameterizing polygon meshes, little if any wo...
123
Voted
AAAI
2008
15 years 4 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
124
Voted
MICCAI
2006
Springer
16 years 3 months ago
2006
Springer
Individual white matter fibers cannot be resolved by current magnetic resonance (MR) technology. Many fibers of a fiber bundle will pass through an individual volume element (voxel...
135
Voted
MICCAI
2008
Springer
16 years 3 months ago
2008
Springer
We propose a method that computes a conformal mapping from a multiply connected mesh to the so-called slit domain, which consists of a canonical rectangle or disk in which 3D curve...
137
Voted
WG
2009
Springer
15 years 9 months ago
2009
Springer
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...