Sciweavers

205 search results - page 26 / 41
» On Parameterized Approximability
Sort
View
ICASSP
2008
IEEE
14 years 4 months ago
Adaptive resolution-constrained scalar multiple-description coding
We consider adaptive two-channel multiple-description coding. We provide an analytical method for designing a resolutionconstrained symmetrical multiple-description coder that use...
Janusz Klejsa, Marcin Kuropatwinski, W. Bastiaan K...
CC
2007
Springer
118views System Software» more  CC 2007»
14 years 4 months ago
A Practical Escape and Effect Analysis for Building Lightweight Method Summaries
We present a unification-based, context-sensitive escape and effect analysis that infers lightweight method summaries describing heap effects. The analysis is parameterized on two...
Sigmund Cherem, Radu Rugina
OOPSLA
2007
Springer
14 years 3 months ago
Dependent classes
Dependent Classes Vaidas Gasiunas and Mira Mezini Technische Universit¨at Darmstadt, Germany Abstract. Dependent classes are parameterized classes, the interface and implementatio...
Vaidas Gasiunas, Mira Mezini, Klaus Ostermann
ANTSW
2006
Springer
14 years 1 months ago
Kernelization as Heuristic Structure for the Vertex Cover Problem
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
Stephen Gilmour, Mark Dras
NIPS
2004
13 years 11 months ago
Log-concavity Results on Gaussian Process Methods for Supervised and Unsupervised Learning
Log-concavity is an important property in the context of optimization, Laplace approximation, and sampling; Bayesian methods based on Gaussian process priors have become quite pop...
Liam Paninski