1480 search results - page 80 / 296 » Distributed algorithms for weighted problems in sparse graph... |
ICAC
2006
IEEE
14 years 4 months ago
2006
IEEE
— Over the past decade, wide-area distributed computing has emerged as a powerful computing paradigm. Virtual machines greatly simplify wide-area distributed computing ing the ab...
ICDCS
2010
IEEE
14 years 12 days ago
2010
IEEE
Abstract—Coverage problem is a fundamental issue in wireless ad hoc and sensor networks. Previous techniques for coverage scheduling often require accurate location information o...
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
Sparse representations over redundant dictionaries offer an efficient paradigm for signal representation. Recently block-sparsity has been put forward as a prior condition for so...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
SODA
2000
ACM
13 years 11 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...