3875 search results - page 602 / 775 » Approximation algorithms for the 0-extension problem |
225
click to vote
ICCV
2011
IEEE
14 years 7 months ago
2011
IEEE
Low-Rank Representation (LRR) [16, 17] is an effective method for exploring the multiple subspace structures of data. Usually, the observed data matrix itself is chosen as the dic...
172
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Distributed Constraints Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned b...
200
Voted
PODC
2009
ACM
16 years 7 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...
171
click to vote
AAMAS
2010
Springer
15 years 7 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 ...
185
Voted
ECCV
2004
Springer
2004
Springer
Unifying Approaches and Removing Unrealistic Assumptions in Shape from Shading: Mathematics Can Help
16 years 9 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 ...