1480 search results - page 67 / 296 » Distributed algorithms for weighted problems in sparse graph... |
100
Voted
ICASSP
2008
IEEE
15 years 7 months ago
2008
IEEE
The average consensus problem in the distributed signal processing context is addressed by linear iterative algorithms, with asymptotic convergence to the consensus. The convergen...
110
click to vote
ICPP
1993
IEEE
15 years 4 months ago
1993
IEEE
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. If the execution of the program is known ahead of time, then the tasks can be st...
103
Voted
STOC
2009
ACM
16 years 1 months ago
2009
ACM
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
126
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We initiate the study of sparse recovery problems under the Earth-Mover Distance (EMD). Specifically, we design a distribution over m × n matrices A such that for any x, given A...
110
click to vote
CIAC
2010
Springer
15 years 10 months ago
2010
Springer
In this paper we consider a natural generalization of the well-known Max Leaf
Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as
input an undirected co...