Sciweavers

205 search results - page 16 / 41
» On Parameterized Approximability
Sort
View
FCT
2007
Springer
14 years 2 months ago
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
Gábor Erdélyi, Lane A. Hemaspaandra,...
DAC
2005
ACM
14 years 11 months ago
Approximate VCCs: a new characterization of multimedia workloads for system-level MpSoC design
System-level design methods specifically targeted towards multimedia applications have recently received a lot of attention. Multimedia workloads are known to have a high degree o...
Yanhong Liu, Samarjit Chakraborty, Wei Tsang Ooi
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
14 years 8 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
GRAPHICSINTERFACE
1997
14 years 5 days 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...
SAC
2010
ACM
14 years 5 months ago
Variable ranges in linear constraints
We introduce an extension of linear constraints, called linearrange constraints, which allows for (meta-)reasoning about the approximation width of variables. Semantics for linear...
Salvatore Ruggieri, Fred Mesnard