10901 search results - page 77 / 2181 » Approximations in Distributed Optimization |
165
click to vote
NIPS
2003
15 years 7 months ago
2003
We consider the question of how well a given distribution can be approximated with probabilistic graphical models. We introduce a new parameter, effective treewidth, that captures...
163
click to vote
OPODIS
2007
15 years 7 months ago
2007
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...
166
click to vote
ICIP
2005
IEEE
16 years 7 months ago
2005
IEEE
In this paper the blind deconvolution problem is formulated using the variational framework. With its use approximations of the involved probability distributions are developed re...
168
click to vote
SIROCCO
2008
15 years 7 months ago
2008
In this paper, we consider the clustering of resources on large scale platforms. More precisely, we target parallel applications consisting of independant tasks, where each task is...
193
click to vote
COCOON
2007
Springer
16 years 10 days ago
2007
Springer
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...