1554 search results - page 68 / 311 » Parameterized Complexity and Approximation Algorithms |
138
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently devel...
116
click to vote
PG
2007
IEEE
15 years 9 months ago
2007
IEEE
Caustics are important visual phenomena, as well as challenging global illumination effects in computer graphics. Physically caustics can be interpreted from one of two perspectiv...
117
click to vote
SARA
2007
Springer
15 years 9 months ago
2007
Springer
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are NPhard. To overcom...
107
Voted
SIAMJO
2008
15 years 2 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
145
Voted
COMPGEOM
2011
ACM
14 years 6 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...