790 search results - page 19 / 158 » Subexponential Parameterized Algorithms |
TCS
2010
14 years 10 months ago
2010
COMGEO
2010
ACM
15 years 5 days ago
2010
ACM
We present the IteratedTverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S Rd with running time subexponential in d. The alg...
COCO
2004
Springer
15 years 5 months ago
2004
Springer
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S ∈ P, A−S is still complete, where f(n) ranges f...
117
click to vote
SGP
2003
15 years 1 months ago
2003
We solve the problem of computing global conformal parameterizations for surfaces with nontrivial topologies. The parameterization is global in the sense that it preserves the con...
COCO
2007
Springer
15 years 4 months ago
2007
Springer