5595 search results - page 853 / 1119 » Approximation Algorithms for Clustering Problems |
174
click to vote
ECCV
2004
Springer
2004
Springer
Unifying Approaches and Removing Unrealistic Assumptions in Shape from Shading: Mathematics Can Help
16 years 8 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 ...
195
click to vote
PODS
2001
ACM
16 years 6 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...
163
click to vote
CVPR
2010
IEEE
16 years 2 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...
157
click to vote
INFOCOM
2006
IEEE
16 years 20 days 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...
206
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...