3894 search results - page 576 / 779 » Approximation Algorithms for Biclustering Problems |
134
click to vote
PODC
2009
ACM
16 years 4 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...
123
Voted
AAMAS
2010
Springer
15 years 3 months ago
2010
Springer
Abstract In this paper we address the problem of simultaneous learning and coordination in multiagent Markov decision problems (MMDPs) with infinite state-spaces. We separate this ...
123
click to vote
ECCV
2004
Springer
2004
Springer
Unifying Approaches and Removing Unrealistic Assumptions in Shape from Shading: Mathematics Can Help
16 years 5 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 ...
152
Voted
PODS
2001
ACM
16 years 3 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...
129
click to vote
CVPR
2010
IEEE
15 years 11 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...