3875 search results - page 653 / 775 » Approximation Algorithms for the Max-coloring Problem |
PODC
2009
ACM
14 years 9 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
ECCV
2004
Springer
2004
Springer
Unifying Approaches and Removing Unrealistic Assumptions in Shape from Shading: Mathematics Can Help
14 years 11 months ago
This article proposes a solution of the Lambertian Shape From Shading (SFS) problem by designing a new mathematical framework based on the notion of viscosity solutions. The power ...
PODS
2001
ACM
14 years 9 months ago
2001
ACM
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
We introduce locally-rigid motion, a general framework for solving the M-point, N-view structure-from-motion problem for unknown bodies deforming under orthography. The key idea i...
INFOCOM
2006
IEEE
14 years 3 months ago
2006
IEEE
— Trade-off curves for the exact and the relaxed QoS routing problem are presented and discussed. In addition, an efficient parametric linear programming algorithm to compute th...