Search
Now showing items 1-3 of 3
Recovery Algorithms for planted structures in Semi-random models
For many NP-hard problems, the analysis of best-known approximation algorithms yields “poor” worst-case guarantees. However, using various heuristics, the problems can be solved (to some extent) in real-life instances. ...
Fast High-Dimensional Filtering
Smoothing (diffusion) is a fundamental task in low-level vision and image processing. In the context of natural images, where edges (sharp discontinuities) play an important psychovisual role, the smoothing process needs ...
Approximation Algorithms for Geometric Packing Problems
We study approximation algorithms for the geometric bin packing problem and its variants. In the two-dimensional geometric bin packing problem (2D GBP), we are given n rectangular items and we have to compute an axis-parallel ...