1480 search results - page 161 / 296 » Distributed algorithms for weighted problems in sparse graph... |
85
Voted
CDC
2008
IEEE
15 years 7 months ago
2008
IEEE
— We take a structural approach to the problem of designing the edge weights in an undirected graph subject to an upper bound on their total, so as to maximize the algebraic conn...
111
click to vote
ICPP
2005
IEEE
15 years 6 months ago
2005
IEEE
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
84
Voted
SSS
2010
Springer
14 years 11 months ago
2010
Springer
The earlier work on predicate detection has assumed that the given computation is finite. Detecting violation of a liveness predicate requires that the predicate be evaluated on a...
108
Voted
CORR
2010
Springer
15 years 24 days ago
2010
Springer
This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequencydivision multi...
130
Voted
SMI
2007
IEEE
15 years 7 months ago
2007
IEEE
In this paper, we propose a new algorithm for the fundamental problem of reconstructing surfaces from a large set of unorganized 3D data points. The local shapes of the surface ar...