1272 search results - page 17 / 255 » Approximate Parameterized Matching |
FAW
2008
Springer
14 years 11 months ago
2008
Springer
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...
IWPEC
2004
Springer
15 years 2 months ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
DAC
2007
ACM
15 years 10 months ago
2007
ACM
In this paper we propose a novel parameterized macromodeling technique for analog circuits. Unlike traditional macromodels that are only extracted for a small variation space, our...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
Parameterized Appearance Models (PAMs) (e.g. eigentracking, active appearance models, morphable models) use Principal Component Analysis (PCA) to model the shape and appearance of...
100
click to vote
WG
2009
Springer
15 years 4 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...