790 search results - page 60 / 158 » Subexponential Parameterized Algorithms |
121
click to vote
COMPUTING
2007
15 years 3 months ago
2007
The discrete Laplace-Beltrami operator plays a prominent role in many Digital Geometry Processing applications ranging from denoising to parameterization, editing, and physical si...
122
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
118
click to vote
CSDA
2006
15 years 3 months ago
2006
Likelihood-based marginal regression modelling for repeated, or otherwise clustered, categorical responses is computationally demanding. This is because the number of measures nee...
108
click to vote
ISSAC
1999
Springer
15 years 7 months ago
1999
Springer
In this paper we study the generic setting of the modular GCD algorithm. We develop the algorithm for multivariate polynomials over Euclidean domains which have a special kind of ...
103
click to vote
ECBS
2000
IEEE
15 years 7 months ago
2000
IEEE
We apply the XMC model checker to the Java metalocking algorithm, a highly optimized technique for ensuring mutually exclusive access by threads to object monitor queues. Our abst...