2681 search results - page 133 / 537 » Problem F |
ICIP
2009
IEEE
14 years 11 months ago
2009
IEEE
We wish to recover an original image u from several blurry-noisy versions fk, called frames. We assume a more severe degradation model, in which the image u has been blurred by a ...
STOC
2009
ACM
14 years 11 months ago
2009
ACM
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
GIS
2006
ACM
14 years 11 months ago
2006
ACM
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in...
STOC
2007
ACM
14 years 10 months ago
2007
ACM
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...
STOC
2007
ACM
14 years 10 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...